A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment

We propose a new approach to Inductive Logic Programming i that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computation, is more amenable to the use of set-oriented generation and evaluation of hypotheses, and allows relational DBMS technology to be more easily applied to ILP systems. Further, our approach opens up new avenues such as probabilistically scoring rules during search and the generation of probabilistic rules. As a first example of the benefits of our ILP framework, we propose a scheme for denning the hypothesis search space through Inverse Entailment using multiple example seeds. © Springer-Verlag Berlin Heidelberg 2005.

Duke Scholars

Author David Page Biostatistics & Bioinformatics, Division of Biostatistics