Abstract
Plotkin's notions of relative θ-subsumption and relative least general generalization of clauses are defined for full clauses, and they are defined in terms of a kind of resolution derivations called C-derivations. Techniques for generalization of clauses relative to a theory, based on the V-operators or saturation in its original form, have primarily been developed for Horn clauses. We show that these techniques are incomplete for full clauses, which is due to the restricted form of resolution derivations considered. We describe a technique for generalization of clauses relative to a theory, which is based on a generalization of the original saturation technique. We prove that our technique properly inverts C-derivations, and that it is complete for full clauses w.r.t. relative θ-subsumption.
Article PDF
Similar content being viewed by others
References
Chang, C., & Lee, R. (1973). Symbolic Logic and Mechanical Theorem Proving, London: Academic Press.
Gallier, J.H. (1986). Logic for Computer Science-Foundations of Automatic Theorem Proving, Harper & Row Publishers.
Genesereth, M.R., & Nilsson, N.J. (1987). Logical Foundations of Artificial Intelligence, Morgan Kaufmann.
Hume, D., & Sammut, C. 1991. Using inverse resolution to learn relations from experiments. In Proceedings of the Eighth International Workshop on Machine Learning, Morgan Kaufmann.
Idestam-Almquist, P. (1992). Learning missing clauses by inverse resolution. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, Tokyo: Ohmsha Publishers.
Idestam-Almquist, P. (1995). Generalization of clauses under implication. Journal of Artificial Intelligence Research, 3:467-489.
Lloyd, J.W. (1987). Foundations of Logic Programming, Springer-Verlag. Second edition.
Muggleton, S. (1991). Inductive logic programming. New Generation Computing Journal, 8(4):295-318.
Muggleton, S. (1993). Inductive logic programming: Derivations, successes and shortcomings. In Proceedings of the Sixth European Conference on Machine Learning, Springer-Verlag.
Muggleton, S. & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth International Conference on Machine Learning, Morgan Kaufmann.
Plotkin, G.D. (1970). A note on inductive generalization. In B. Meltzer & D. Michie (Eds.), Machine Intelligence, Edinburgh University Press, 5:153-163.
Plotkin, G.D. (1971). Automatic Methods of Inductive Inference. Ph.D. thesis, Edinburgh University.
Plotkin, G.D. (1971). A further note on inductive generalization. In B. Meltzer & D. Michie (Eds.), Machine Intelligence, Edinburgh University Press, 6:101-124.
Rouveirol, C. (1990). Saturation: Postponing choices when inverting resolution. In Proceedings of the Ninth European Conference on Artificial Intelligence, Pitman.
Rouveirol, C. (1992). Extensions of inversion of resolution applied to theory completion. In S. Muggleton (Ed.), Inductive Logic Programming, San Diego, California: Academic Press.
Rouveirol, C. & Puget, J.-F. (1989). A simple solution for inverting resolution. In Proceedings of the Fourth European Working Session on Learning, Pitman.
Sammut, C. (1981). Concept learning by experiment. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Loss Altos, California: William Kaufmann.
Wirth, R. (1989). Completing logic programs by inverse resolution. In Proceedings of the Fourth European Working Session on Learning, Pitman.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Idestam-Almquist, P. Generalization of Clauses Relative to a Theory. Machine Learning 26, 213–226 (1997). https://doi.org/10.1023/A:1007369324877
Issue Date:
DOI: https://doi.org/10.1023/A:1007369324877