A note on refinement operators
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.
- E.M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.Google Scholar
- S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming, pages 281–298. Academic Press, London, 1992.Google Scholar
- 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.Google Scholar
- G.D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, August 1971.Google Scholar
- 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.Google Scholar
- E. Y. Shapiro. An algorithm that infers theories from facts. In Proceedings of IJCAI-81, pages 446–451. Kaufmann, Los Altos, CA, 1981.Google Scholar
- E.Y. Shapiro. Inductive inference of theories from facts. TR 192, Dept. Comp. Sc., Yale University, Connecticut, 1981.Google Scholar
- E.Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.Google Scholar