Abstract
The top down induction of logic programs is faced with the problem of ensuring that the search space includes all the desired hypotheses. The conventional way of of organizing the search space is via refinement of clauses. Within this context the existence of a well behaved refinement operator complete for Horn clause logic is desirable.
We show that there is no natural way in which a complete refinement operator can be defined which avoids the production of non-reduced clauses. Consideration is given to subsets of full Horn clause logic for which more efficient refinement operators can be constructed.
Chapter PDF
Similar content being viewed by others
Category
References
E.M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming, pages 281–298. Academic Press, London, 1992.
G.D. Plotkin. A note on inductive generalisation. In B. Meltzer and D. Michie, editors. Machine Intelligence 5, pages 153–163. Elsevier North-Holland, New York, 1970.
G.D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, August 1971.
G.D. Plotkin. A further note on inductive generalisation. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 101–124. Elsevier North-Holland, New York, 1971.
E. Y. Shapiro. An algorithm that infers theories from facts. In Proceedings of IJCAI-81, pages 446–451. Kaufmann, Los Altos, CA, 1981.
E.Y. Shapiro. Inductive inference of theories from facts. TR 192, Dept. Comp. Sc., Yale University, Connecticut, 1981.
E.Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niblett, T. (1993). A note on refinement operators. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_146
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive