Abstract
The Resolution procedure of J. A. Robinson is shown to remain a complete proof procedure when the refutations permitted are restricted so that clauses C and D and resolvent R of clauses C and D meet the following conditions: (1) C is the resolvent immediately preceding R in the refutation if any resolvent precedes R, (2) either D is a member of the given set S of clauses or D precedes C in the refutation and R subsumes an instance of C or R is the empty clause, and (3) R is not a tautology.
Keywords
- Initial Segment
- Primary Branch
- Primary Node
- Ground Instance
- Final Segment
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by the Advanced Research Projects Agency of the Office of the Secretary of Defense (F44620-67-C-0058) and is monitored by the Air Force Office of Scientific Research. This document has been approved for public release and sale; its distribution is unlimited.
This research was also partially supported by NSF Grant GP-7064.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Andrews, P. B. "Resolution with merging", J.ACM, 15, 3 (July 1968), 367–381.
Robinson, J. A. "A machine-oriented logic based on the resolution principle," J.ACM, 12, 1 (Jan. 1965), 23–41.
Robinson, J. A. "Automatic deduction with hyper-resolution", Int. J. Computer Math. 1 (1965), 227–234.
Wos, L., G. A. Robinson and D. F. Carson. "Efficiency and completeness of the set of support strategy in theorem proving", J.ACM 12, 4 (Oct. 1965), 536–541.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag
About this paper
Cite this paper
Loveland, D.W. (1970). A linear format for resolution. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds) Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060630
Download citation
DOI: https://doi.org/10.1007/BFb0060630
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04914-2
Online ISBN: 978-3-540-36262-3
eBook Packages: Springer Book Archive
