Predicate Invention from a Few Examples

One main difficulty of Inductive Logic Programming lies in learning recursively defined predicates. Today's systems strongly rely on a set of supporting predicates known as the background knowledge, which assumes that the user knows in advance what sort of predicates are required by the target definition. Predicate invention can remedy the situation by extending the specification language with new concepts that appear neither in the examples nor in the background knowledge, and finding a definition for them. A serious concern is that no examples of the invented predicate are explicitly given but rather of the target predicate, so learning has to be done in the absence or scarcity of examples. This work shows an autonomous learning method based on inverting clausal implication that can invent the recursive predicates it needs. The learner is endowed with means to work from a small data set.

[1]  William W. Cohen.  Pac-learning Recursive Logic Programs: Negative Results , 1994, J. Artif. Intell. Res..

[2]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .

[3]  Masayuki Numao,et al.  Discrimination-Based Constructive Induction of Logic Programs , 1992, AAAI.

[4]  Riverson. Rios.  Learning recursive definitions in prolog. , 1998 .

[5]  G. Plotkin.  Automatic Methods of Inductive Inference , 1972 .

[6]  Stephen Muggleton,et al.  Inductive logic programming: derivations, successes and shortcomings , 1993, SGAR.

[7]  Christel Vrain,et al.  Systematic Predicate Invention in Inductive Logic Programming , 1997, ILP.

[8]  Francesco Bergadano,et al.  An Interactive System to Learn Functional Logic Programs , 1993, IJCAI.

[9]  Peter Idestam-Almquist,et al.  Generalization of clauses , 1993 .

[10]  Stan Matwin,et al.  Sub-unification: A Tool for Efficient Induction of Recursive Programs , 1992, ML.

[11]  Leszek Pacholski,et al.  Undecidability of the Horn-clause implication problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  C. Feng,et al.  Temporal Decision Trees: Model-based Diagnosis of Dynamic Systems On-Board , 2003, J. Artif. Intell. Res..

[13]  Stan Matwin,et al.  Constructive Inductive Logic Programming , 1993, IJCAI.

[14]  Charles X. Ling,et al.  Inductive Learning from Good Examples , 1991, IJCAI.

[15]  Stan Matwin,et al.  Efficient Induction of Recursive Prolog Definitons , 1996, Canadian Conference on AI.

[16]  Stan Matwin,et al.  Inverting Implication with Small Training Sets , 1994, ECML.

[17]  Manfred Schmidt-Schauß.  Implication of Clauses is Undecidable , 1988, Theor. Comput. Sci..