Inductive logic programming

related topics
{math, number, function}
{theory, work, human}
{work, book, publish}
{style, bgcolor, rowspan}

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[1] in a paper by Stephen Muggleton in 1991.


See also

International Conferences on Inductive Logic Programming



  • 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.

Full article ▸

related documents
Classical logic
Super-Poulet number
Gauss–Markov process
Unix billennium
Wilhelm Ackermann
Vladimir Voevodsky
Mathematical constants (sorted by continued fraction representation)
Wikipedia:Free On-line Dictionary of Computing/X - Z
August Ferdinand Möbius
Ninety-ninety rule
Structure and Interpretation of Computer Programs
Facade pattern
National Center for Biotechnology Information
Hill system
Object-oriented programming language
Statistical regularity
List of FIPS country codes
Shotgun debugging
Type 1 encryption
Cypherpunk anonymous remailer
List of counties in Nevada
Code word
The Free Software Definition
International Air Transport Association airport code