Inductive Logic Programming: issues, results and the LLL challenge

S. Muggleton. In H. Prade, editor, Proceedings of ECAI98, page 697. John Wiley, 1998. More behind this link.. Abstract of keynote talk

Abstract

Inductive Logic Programming (ILP) \citemugg:ilp,mugg:der is the area of AI which deals with the induction of hypothesised predicate definitions from examples and background knowledge. Logic programs are used as a single representation for examples, background knowledge and hypotheses. ILP is differentiated from most other forms of Machine Learning (ML) both by its use of an expressive representation language and its ability to make use of logically encoded background knowledge. This has allowed successful applications of ILP \citebratmug:ilpapp in areas such as molecular biology \citestern:roysoc,muggks:proteins,kmuggs:muta, Finn+Muggleton+Page+Srinivasan/98/Discovery and natural language \citemooney:nlp,CusPagMugSri97:ECML97,Cus97-ILP97 which both have rich sources of background knowledge and both benefit from the use of an expressive concept representation languages. For instance, the ILP system Progol has recently been used to generate comprehensible descriptions of the 23 most populated fold classes of proteins \citeturcotte:folds, where no such descriptions had previously been formulated manually. In the natural language area ILP has not only been shown to have higher accuracies than various other ML approaches in learning the past tense of English \citemooney:foidl but also shown to be capable of learning accurate grammars which translate sentences into deductive database queries \citezelle:semantics. In both cases, follow up studies \citethompson:semantics,dzer:nominal have shown that these ILP approaches to natural language problems extend with relative ease to various languages other than English. The area of Learning Language in Logic (LLL) is producing a number of challenges to existing ILP theory and implementations. In particular, language applications of ILP require revision and extension of a hierarchically defined set of predicates in which the examples are typically only provided for predicates at the top of the hierarchy. New predicates often need to be invented, and complex recursion is usually involved. Similarly the term structure of semantic objects is far more complex than in other applications of ILP. Advances in ILP theory and implementation related to the challenges of LLL are already producing beneficial advances in other sequence-oriented applications of ILP. In addition LLL is starting to develop its own character as a sub-discipline of AI involving the confluence of computational linguistics, machine learning and logic programming.

BibTeX entry.

Inductive Logic Programming: issues, results and the LLL challenge

Abstract

Other publications