Foundations of Inductive Logic Programming

  • Nienhuys-Cheng S
  • De Wolf R
PMID: 708261
N/ACitations
Citations of this article
66Readers
Mendeley users who have this article in their library.

Abstract

Inductive Logic Programming is a young and rapidly growing field combining machine learning and logic programming. This self-contained tutorial is the first theoretical introduction to ILP; it provides the reader with a rigorous and sufficiently broad basis for future research in the area. In the first part, a thorough treatment of first-order logic, resolution-based theorem proving, and logic programming is given. The second part introduces the main concepts of ILP and systematically develops the most important results on model inference, inverse resolution, unfolding, refinement operators, least generalizations, and ways to deal with background knowledge. Furthermore, the authors give an overview of PAC learning results in ILP and of some of the most relevant implemented systems.

Cite

CITATION STYLE

APA

Nienhuys-Cheng, S. H., & De Wolf, R. (1997). Foundations of Inductive Logic Programming. (J. Siekmann & J. G. Carbonell, Eds.), Lecture Notes in Computer Science (Vol. 1228, p. xvii + 404). Springer. Retrieved from http://www.springer.de/cgi-bin/search%7B_%7Dbook.pl?isbn=3-540-62927-0 http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-62927-0

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