Challenges for inductive logic programming

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Inductive logic programming (ILP) is a research area that has its roots in inductive machine learning and logic programming. Computational logic has significantly influenced machine learning through the field of inductive logic programming (ILP) which is concerned with the induction of logic programs from examples and background knowledge. Machine learning, and ILP in particular, has the potential to influence computational logic by providing an application area full of industrially significant problems, thus providing a challenge for other techniques in computational logic. In ILP, the recent shift of attention from program synthesis to knowledge discovery resulted in advanced techniques that are practically applicable for discovering knowledge in relational databases. This paper gives a brief introduction to ILP, presents state-of-the-art ILP techniques for relational knowledge discovery as well as some chal-legnes and directions for further developments in this area.

Cite

CITATION STYLE

APA

Lavrač, N. (1999). Challenges for inductive logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1695, pp. 16–33). Springer Verlag. https://doi.org/10.1007/3-540-48159-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free