Learning in Clausal Logic: A Perspective on Inductive Logic Programming

Peter Flach and Nada Lavrac. In Antonis C. Kakas and Fariba Sadri, editors, Computational Logic: Logic Programming and Beyond (Essays in Honour of Robert A. Kowalski), volume 2407 of Lecture Notes in Artificial Intelligence, pages 437--471. Springer-Verlag, Berlin, 2002.

Abstract

Inductive logic programming is a form of machine learning from examples which employs the representation formalism of clausal logic. One of the earliest inductive logic programming systems was Ehud Shapiro's Model Inference System, which could synthesise simple recursive programs like append/3. Many of the techniques devised by Shapiro, such as top-down search of program clauses by refinement operators, the use of intensional background knowledge, and the capability of inducing recursive clauses, are still in use today. On the other hand, significant advances have been made regarding dealing with noisy data, efficient heuristic and stochastic search methods, the use of logical representations going beyond definite clauses, and restricting the search space by means of declarative bias. The latter is a general term denoting any form of restrictions on the syntactic form of possible hypotheses. These include the use of types, input/output mode declarations, and clause schemata. Recently, some researchers have started using alternatives to Prolog featuring strong typing and real functions, which alleviate the need for some of the above ad-hoc mechanisms. Others have gone beyond Prolog by investigating learning tasks in which the hypotheses are not definite clause programs, but for instance sets of indefinite clauses or denials, constraint logic programs, or clauses representing association rules. The chapter gives an accessible introduction to the above topics. In addition, it outlines the main current research directions which have been strongly influenced by recent developments in data mining and challenging real-life applications.

BibTeX entry.

Other publications

P A Flach, Peter.Flach@bristol.ac.uk,