Inductive logic programming
- Inductive logic programming
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
Implementations
* PROGOL (http://www.doc.ic.ac.uk/~shm/Software/progol5.0)
* Golem (ILP) (http://www.doc.ic.ac.uk/~shm/Software/golem)
* Aleph (http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/)
* Foil (ftp://ftp.cs.su.oz.au/pub/foil6.sh)
* Claudien (http://www.cs.kuleuven.ac.be/~ml/CWIS/claudien-E.shtml)
* Lime (http://cs.anu.edu.au/people/Eric.McCreath/lime.html)
* ACE (http://www.cs.kuleuven.ac.be/~dtai/ACE/)
* DMax (http://www.pharmadm.com/dmax.asp)
* Warmr (http://www.cs.kuleuven.ac.be/~ml/Doc/TW_User/)
* RSD (http://labe.felk.cvut.cz/~zelezny/rsd/)
* Mio (http://kd.cs.uni-magdeburg.de/~pena/)
* DL-Learner (http://dl-learner.org)
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 [http://www-ai.ijs.si/SasoDzeroski/ILPBook/ Publicly available online version] .
Wikimedia Foundation.
2010.
Look at other dictionaries:
Logic programming — is, in its broadest sense, the use of mathematical logic for computer programming. In this view of logic programming, which can be traced at least as far back as John McCarthy s [1958] advice taker proposal, logic is used as a purely declarative… … Wikipedia
Abductive logic programming — is a high level knowledge representation framework that can be used to solve problems declaratively based on abductive reasoning. It extends normal Logic Programming by allowing some predicates to be incompletely defined, declared as abducible… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Programming paradigm — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concu … Wikipedia
Programming in the large and programming in the small — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Logic — For other uses, see Logic (disambiguation). Philosophy … Wikipedia
List of topics in logic — This is a list of topics in logic.See also: List of mathematical logic topicsAlphabetical listAAbacus logic Abduction (logic) Abductive validation Affine logic Affirming the antecedent Affirming the consequent Antecedent Antinomy Argument form… … Wikipedia
Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… … Wikipedia
Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Declarative programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
