Incremental Learning of Functional Logic Programs

In this work, we consider the extension of the Inductive Functional Logic Programming (IFLP) framework in order to learn functions in an incremental way. In general, incremental learning is necessary when the number of examples is infinite, very large or presented one by one. We have performed this extension in the FLIP system, an implementation of the IFLP framework. Several examples of programs which have been induced indicate that our extension pays off in practice. An experimental study of some parameters which affect this efficiency is performed and some applications for programming practice are illustrated, especially small classification problems and data-mining of semi-structured data.

[1]  Jadzia Cendrowska,et al.  PRISM: An Algorithm for Inducing Modular Rules , 1987, Int. J. Man Mach. Stud..

[2]  Stefan Wrobel,et al.  On the Proper Definition of Minimality in Specialization and Theory Revision , 1993, ECML.

[3]  Francesco Bergadano,et al.  Inductive Logic Programming: From Machine Learning to Software Engineering , 1995 .

[4]  S. Wrobel.  First Order Theory Reenement , 1996 .

[5]  Rokia Missaoui,et al.  An Incremental Concept Formation Approach for Learning from Databases , 1994, Theor. Comput. Sci..

[6]  L. D. Raedt.  Interactive theory revision: an inductive logic programming approach , 1992 .

[7]  Raymond J. Mooney,et al.  Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.

[8]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[9]  José Hernández-Orallo,et al.  Inverse Narrowing for the Induction of Functional Logic Programs , 1998, APPIA-GULP-PRODE.

[10]  Stephen Muggleton,et al.  Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic , 1999, Artif. Intell..

[11]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[12]  Raymond J. Mooney,et al.  First-Order Theory Revision , 1991, ML.

[13]  Jorg-uwe Kietz,et al.  Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models , 1992 .

[14]  M. R. K. Krishna Rao,et al.  A Framework for Incremental Learning of Logic Programs , 1997, Theor. Comput. Sci..

[15]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[16]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

[17]  José Hernández-Orallo,et al.  A Strong Complete Schmema for Inductive Functional Logic Programming , 1999, ILP.