Abstract
Most implemented ILP systems construct hypotheses clause by clause using a refinement operator for clauses. To avoid the problems faced by such greedy covering algorithms, more flexible refinement operators for theories are needed. In this paper we construct a syntactically monotonic, finite and solution-complete refinement operator for theories, which eliminates certain annoying redundancies (due to clause deletions), while also addressing the limitations faced by HYPER’s refinement operator (which are mainly due to keeping the number of clauses constant during refinement).
We also show how to eliminate the redundancies due to the commutativity of refinement operations while preserving weak completeness as well as a limited form of flexibility. The refinement operator presented in this paper represents a first step towards constructing more efficient and flexible ILP systems with precise theoretical guarantees.
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
Badea Liviu, Stanciu M. Refinement Operators can be (weakly) perfect. Proceedings ILP-99, pp. 21–32, LNAI 1634, Springer Verlag, 1999.
Badea Liviu. Perfect Refinement Operators can be Flexible. In Werner Horn, editor, Proceedings ECAI-2000, pp. 266–270. IOS Press, August 2000.
Bratko I. Refining Complete Hypotheses in ILP. Proceedings ILP-99, pp. 44–55, LNAI 1634, Springer Verlag, 1999.
Nienhuys-Cheng S.H., de Wolf R. Foundations of Inductive Logic Programming. LNAI 1228, Springer Verlag 1997.
De Raedt L., Lavrac N., Dzeroski S. Multiple Predicate Learning. In R. Bajcsy, editor, Proceedings IJCAI-93, pages 1037–1043. Morgan Kaufmann, 1993.
Midelfart H. A Bounded Search Space of Clausal Theories. Proc. ILP-99, 210–221.
Muggleton S. Inverse entailment and Progol. New Generation Computing Journal, 13:245–286, 1995.
Quinlan J.R. Learning Logical Definitions from Relations. Machine Learning 5:239–266, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badea, L. (2001). A Refinement Operator for Theories. In: Rouveirol, C., Sebag, M. (eds) Inductive Logic Programming. ILP 2001. Lecture Notes in Computer Science(), vol 2157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44797-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-44797-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42538-0
Online ISBN: 978-3-540-44797-9
eBook Packages: Springer Book Archive