Inductive logic programming

This is an old revision of this page, as edited by Ensor76 (talk | contribs) at 15:58, 21 December 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Inductive logic programming (ILP) is a subfield of machine learning which uses logic programming as a uniform representation for examples, background knowledge and hypotheses. Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the negative examples.

Schema: positive examples + negative examples + background knowledge => hypothesis.

Inductive logic programming is particularly useful in bioinformatics and natural language processing. The term Inductive Logic Programming was first introduced in a paper by Stephen Muggleton in 1991.

International Conferences on Inductive Logic Programming

Year Dates Location Chairs
2008 September 10-12 Prague, Czech Republic, Czech Technical University Filip Zelezny, Nada Lavrac
2007 June 19-21 Corvallis, Oregon, USA, Oregon State University Jude Shavlik, Hendrik Blockeel, Prasad Tadepalli
2006 August 24-27 Santiago de Compostela, Spain Stephen Muggleton, Ramon Otero
2005 August 10-13 Bonn, Germany Stephan Kramer, Bernhard Pfahringer
2004 September 6-8 Porto, Portugal Ashwin Srinivasan, Ross King
2003 September 29-October 1 Szeged, Hungary Tamas Horváth, Akihiro Yamamoto
2002 July 9-11 Sydney, Australia Stan Matwin, Claude Sammut

Implementations

References

  • S.H. Muggleton. Inductive Logic Programming. New Generation Computing, 8(4):295-318, 1991.
  • S.H. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19,20:629-679, 1994.
  • N. Lavrac and S. Dzeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York, 1994, ISBN 0-13-457870-8 Publicly available online version.