Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem

Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and the task is to find a unification of the contained variables such that no negative example is subsumed by the hypothesis and all positive examples are subsumed.

[1]  Nicolas Beldiceanu,et al.  Arc-Consistency for a Chain of Lexicographic Ordering Constraints , 2002 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  JOHN F. Young Machine Intelligence , 1971, Nature.

[4]  Gordon Plotkin,et al.  A Note on Inductive Generalization , 2008 .

[5]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[6]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[7]  Aomar Osmani,et al.  Empirical Study of Relational Learning Algorithms in the Phase Transition Framework , 2009, ECML/PKDD.

[8]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[9]  Eric Monfroy,et al.  Beyond NP: Arc-Consistency for Quantified Constraints , 2002, CP.

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Georg Gottlob,et al.  On the complexity of some inductive logic programming problems , 1997, New Generation Computing.

[12]  Chris Watkins,et al.  Proceedings of the European Conference on Machine Learning (ECML) , 2006 .

[13]  J. van Leeuwen,et al.  Principles and Practice of Constraint Programming - CP 2002 , 2002, Lecture Notes in Computer Science.

[14]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[15]  Michèle Sebag,et al.  Fast Theta-Subsumption with Constraint Satisfaction Algorithms , 2004, Machine Learning.