Abstract
It is often useful to simplify the resolution inference system by elimination of factoring. Factoring, however, cannot be ignored entirely without loosing completeness. This paper studies to what extent factoring is necessary to preserve it. We can show that it is sufficient to factorize only one of the two parent clauses of a resolvent. We apply this basic result to a class of well known refinements and describe for each rule which clause (the so called "selected parent") has at most to be factored.
We try to achieve the results in a transparent manner using only elementary notions of resolution theory, so that this note should be readable without detailed knowledge of resolution strategies.
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
E. Bergmann und H. Noll: Mathematische Logik mit Informatik-Anwendungen. Berlin, Heidelberg, New York: Springer 1977
C.L. Chang and R.C.T. Lee: Symbolic Logic and Mechanical Theorem Proving. New York, London: Academic Press 1973
C. Green: Applications of Theorem Proving to Problem Solving. Proceedings International Joint Conference. Artificial Intelligence, 219–239 (1969)
P.J. Hayes: An Abstract Lifting Theorem. University of Essex. Memo CSM-11, 1975
L.J. Henschen: Unit Refutations and Horn Sets. J. ACM 21, 590–605 (1974)
R. Kowalski: Studies in Completeness and Efficiency of Theorem Proving by Resolution. Ph.D. Thesis, University of Edinburgh, 1970
R. Kowalski: Predicate Logic as Programming Language. Proceedings of the IFIP-Congress, Stockholm, 569–574 (1974)
R. Kowalski and D.G. Kühner: Linear Resolution with Selection Function. Artificial Intelligence 2, 221–260 (1971)
D. Luckham: Refinement Theorems in Resolution Theory. Proceedings IRIA Symposium on Automatic Demonstration. Berlin, Heidelberg, New York: Springer-Verlag, 163–190 (1970)
H. Noll: Eine konstruktive Formulierung des Lifting-Theorems unter expliziter Angabe der liftenden Substitutionen und eine Anwendung auf Faktorisierungs-Einschränkungen. Dissertation, Technische Universität Berlin, Fachbereich 20 — Informatik, 1976 This thesis contains a weaker version of the results presented in this paper.
J.A. Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12, 23–41 (1965)
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noll, H. (1980). A note on resolution: How to get rid of factoring without loosing completeness. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-10009-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10009-6
Online ISBN: 978-3-540-38140-2
eBook Packages: Springer Book Archive