Abstract
The subsumption theorem is an important theorem concerning resolution. Essentially, it says that a set of clauses ∑ logically implies a clause C, iff C is a tautology, or a clause D which subsumes C can be derived from ∑ with resolution. It was originally proved in 1967 by Lee in [Lee67]. In Inductive Logic Programming, interest in this theorem is increasing since its independent rediscovery by Bain and Muggleton [BM92]. It provides a quite natural “bridge” between subsumption and logical implication. Unfortunately, a correct formulation and proof of the subsumption theorem are not available. It is not clear which forms of resolution are allowed. In fact, at least one of the current forms of this theorem is false. This causes a lot of confusion.
In this paper, we give a careful proof of the subsumption theorem for unconstrained resolution, and show that the well-known refutation-completeness of resolution is an immediate consequence of this theorem. On the other hand, we also show here that the subsumption theorem can be proved starting from the refutation-completeness. This establishes that these two results have equal strength.
Furthermore, we show that the subsumption theorem does not hold when only input resolution is used, not even in case ∑ contains only one clause. Since [Mug92, Ide93a] assume the contrary, some results (for instance results on nth roots and nth powers) in these articles should perhaps be reconsidered.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bain, M., and Muggleton, S., ‘Non-monotonic Learning', in: Muggleton, S. (ed.), Inductive Logic Programming, APIC series, no. 38, Academic Press, 1992, pp. 145–153.
Chang, C. L., and Lee, R. C. T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, San Diego, 1973.
Genesereth, M. R., and Nilsson, N. J., Logical Foundations of Artificial Intelligence, Morgan Kaufmann, Palo Alto, 1987.
Idestam-Almquist, P., Generalization of Clauses, PhD Thesis, Stockholm University, 1993.
Idestam-Almquist, P., ‘Generalization under Implication by Recursive Anti-Unification', in: Proceedings of the Tenth International Conference on Machine Learning, Morgan Kaufmann, 1993.
Idestam-Almquist, P., ‘Generalization under Implication by Using Or-Introduction', in: Proceedings of the European Conference on Machine Learning-93, Springer Verlag, 1993.
Idestam-Almquist, P., ‘Generalization under Implication: Expansion of Clauses for Indirect Roots', in: Scandinavian Conference on Artificial Intelligence-93, IOS Press, Amsterdam, Netherlands, 1993.
Kowalski, R., ‘The Case for Using Equality Axioms in Automatic Demonstration', in: Proc. of the Symposium on Automatic Demonstration, Lecture Notes in Mathematics 125, Springer Verlag, 1970, pp.112–127.
van der Laag, P., and Nienhuys-Cheng, S.-H., ‘Existence and Nonexistence of Complete Refinement Operators', in: Proc. the European Conference on Machine Learning (ECML-94), Lecture Notes in Artificial Intelligence 784, Springer-Verlag, pp. 307–322.
van der Laag, P., and Nienhuys-Cheng, S.-H., ‘A Note on Ideal Refinement Operators in Inductive Logic Programming', in: Wrobel, S. (ed.), Proc. of the Fourth Int. Workshop on Inductive Logic Programming (ILP-94), Bad Honnef, Germany, 1994, pp. 247–262.
Lee, R. C. T., A Completeness Theorem and a Computer Program for Finding Theorems Derivable from Given Axioms, PhD Thesis, University of California, Berkeley, 1967.
Lloyd, J. W., Foundations of Logic Programming, Second edition, Springer-Verlag, Berlin, 1987.
Muggleton, S., ‘Inverting Implication', in: Muggleton, S. H., and Furukawa, K. (eds.), Proc. of the Second Int. Workshop on Inductive Logic Programming (ILP-92), ICOT Technical Memorandum TM-1182, 1992.
Muggleton, S., and Page, C. D., ‘Self-Saturation of Definite Clauses', in: Wrobel, S. (ed.), Proc. of the Fourth Int. Workshop on Inductive Logic Programming (ILP-94), Bad Honnef, Germany, 1994, pp. 161–174.
Nienhuys-Cheng, S.-H., van der Laag, P., and van der Torre, L., ‘Constructing Refinement Operators by Deconstructing Logical Implication', in: Proc. of the Third Congress of the Italian Association for Artificial Intelligence (AI*IA93), Lecture Notes in Artificial Intelligence 728, Springer-Verlag, pp. 178–189.
Nienhuys-Cheng, S.-H., and de Wolf, R., ‘The Subsumption Theorem in Inductive Logic Programming: Facts and Fallacies', to appear in: Proc. of the Fifth Workshop on Inductive Logic Programming (ILP-95, workreport), Leuven, September 1995.
Nienhuys-Cheng, S.-H., and de Wolf, R., ‘The Subsumption Theorem Revisited: Restricted to SLD-resolution', to appear in: Proc. of Computing Science in the Netherlands (CSN-95), Utrecht, November 1995.
Slagle, J. R., Chang, C. L., and Lee, R. C. T., ‘Completeness Theorems for Semantic Resolution in Consequence-finding', in: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI-69), 1969, pp. 281–285.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nienhuys-Cheng, SH., de Wolf, R. (1995). The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_50
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive