Data flow coherence criteria in ILP tools

In this paper we present a new method that uses data flow coherence criteria in definite logic program generation. We outline three main advantages of these criteria supported by our results: (i) drastically pruning the search space (around 90%), (ii) reducing the set of positive examples and reducing or even removing the need for the set of negative examples, and (iii) allowing the induction of predicates that are difficult or even impossible to generate by other methods. Besides these criteria, the approach takes into consideration the program termination condition for recursive predicates. The paper outlines some theoretical issues and implementation aspects of our system for automatic logic program induction.