We review our recent research aimed at conquering two sources of complexity of inductive logic programming: the clause subsumption problem and the clause search problem.
We review our recent research aimed at conquering two sources of complexity of inductive logic programming: the clause subsumption problem and the clause search problem. (en)