Abstract
Inductive Logic Programming (ILP) deals with inductive inference in first order Horn logic. A commonly employed restriction on the hypothesis space in ILP is that to function-free programs. It yields a more tractable hypothesis space, and simplifies induction. This paper investigates basic properties of ILP in function-free languages.
Chapter PDF
Similar content being viewed by others
References
Muggleton, S. (1992): Inductive Logic Programming, in S. Muggleton (ed): Inductive Logic Programming, Academic Press
Quinlan, J. R. (1990): Learning Logical Definitions from Relations, Machine Learning 5
De Raedt, L., Feyaerts, J., Bruynooghe, M. (1991): Acquiring Object-Knowledge for Learning Systems, in Y. Kodratoff (ed): Proceedings of the Fifth European Working Session on Learning, Springer
Reinhardt, K. (1993), personal communication
Rouveirol, C. (1991): ITOU: Induction of First Order Theories, in S. Muggleton (ed): Inductive Logic Programming, Academic Press
Stahl, I. (1994): On the Utility of Predicate Invention in Inductive Logic Programming, this volume
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stahl, I. (1994). Properties of Inductive Logic Programming in function-free Horn logic. In: Bergadano, F., De Raedt, L. (eds) Machine Learning: ECML-94. ECML 1994. Lecture Notes in Computer Science, vol 784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57868-4_89
Download citation
DOI: https://doi.org/10.1007/3-540-57868-4_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57868-0
Online ISBN: 978-3-540-48365-6
eBook Packages: Springer Book Archive