Automatic Induction of Abduction and Abstraction Theories from Observations

Traditional Machine Learning approaches are based on single inference mechanisms. A step forward concerned the integration of multiple inference strategies within a first-order logic learning framework, taking advantage of the benefits that each approach can bring. Specifically, abduction is exploited to complete the incoming information in order to handle cases of missing knowledge, and abstraction is exploited to eliminate superfluous details that can affect the performance of a learning system. However, these methods require some background information to exploit the specific inference strategy, that must be provided by a domain expert. This work proposes algorithms to automatically discover such an information in order to make the learning task completely autonomous. The proposed methods have been tested on the system INTHELEX, and their effectiveness has been proven by experiments in a real-world domain.

[1]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[2]  Peter A. Flach,et al.  Confirmation-Guided Discovery of First-Order Rules with Tertius , 2004, Machine Learning.

[3]  Paolo Mancarella,et al.  Generalized Stable Models: A Semantics for Abduction , 1990, ECAI.

[4]  Céline Rouveirol,et al.  Beyond Inversion of Resolution , 1990, ML.

[5]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[6]  H. Penny Nii,et al.  The Handbook of Artificial Intelligence , 1982 .

[7]  Nicola Fanizzi,et al.  Incremental multistrategy learning for document processing , 2003, Appl. Artif. Intell..

[8]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[9]  Antonis Kakas,et al.  Abduction and Learning , 1996 .

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

[11]  Saso Dzeroski,et al.  Integrating Explanatory and Descriptive Learning in ILP , 1997, IJCAI.

[12]  Lorenza Saitta,et al.  Abstracting Concepts with Inverse Resolution , 1991, ML.

[13]  Luc De Raedt,et al.  Clausal Discovery , 1997, Machine Learning.

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

[15]  Stefano Ferilli,et al.  Automatic Induction of First-Order Logic Descriptors Type Domains from Observations , 2004, ILP.

[16]  Gerard Salton,et al.  Term-Weighting Approaches in Automatic Text Retrieval , 1988, Inf. Process. Manag..

[17]  Ryszard S. Michalski,et al.  Inferential Theory of Learning: Developing Foundations for Multistrategy Learning , 1992 .

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

[19]  Jean-Daniel Zucker,et al.  Semantic Abstraction for Concept Representation and Learning , 2001 .

[20]  Paul E. Utgoff,et al.  Shift of bias for inductive concept learning , 1984 .

[21]  Evelina Lamma,et al.  Cooperation of Abduction and Induction in Logic Programming , 2000 .