Abstract
Since its inception, the field of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in refinement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the field. This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wray Buntine. Generalized subsumption and its applications to induction and redundancy. Artificial Intelligence, 36(2):149–176, 1988.
Alan M. Frisch. The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence, 49:161–198, 1991.
Alan M. Frisch and C. David Page Jr. Generalization with taxonomic information. In Proc. of the Eighth National Conf. on Artificial Intelligence, pages 755–761, Boston, MA, July 1990.
Alan M. Frisch and C. David Page Jr. Building theories into instantiation. In Proc. of the Fourteenth Int. Joint Conf. on Artificial Intelligence, pages 1210–1216, Montreal, Canada, August 1995.
Philip D. Laird. Learning from Good and Bad Data. Kluwer Academic Publishers, Boston, MA, 1988.
Shan-Hwei Nienhuys-Cheng and Ronald de Wolf. Foundations of Inductive Logic Programming. Springer-Verlag, 1997.
C. David Page Jr. Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning, and to Deduction. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1993.
C. David Page Jr. and Alan M. Frisch. Generalization and learnability: A study of constrained atoms. In Stephen H. Muggleton, editor, Inductive Logic Programming, chapter 2, pages 29–61. Academic Press, London, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frisch, A.M. (1999). Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Logic Programming. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-48751-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66109-2
Online ISBN: 978-3-540-48751-7
eBook Packages: Springer Book Archive