Abstract
A refinement of the resolution method for mechanical theorem proving is presented. A resolvent C of clauses A and B is called a merge if literals from A and B merge together to form some literal of C. It is shown that the resolution method remains complete if it is required that two noninitial clauses which are not merges never be resolved with one another. It is also shown that this strategy can be combined with the set-of-support strategy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
G.A. Wilson and J. Minker, “Resolution, Refinements, and Search Strategies: A Comparative Study”, IEEE Transactions on Computers C-25 (1976), 782–801.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1968 Association for Computing Machinery, Inc.
About this chapter
Cite this chapter
Andrews, P.B. (1968). Resolution with Merging. In: Siekmann, J.H., Wrightson, G. (eds) Automation of Reasoning. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-81955-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-81955-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-81957-5
Online ISBN: 978-3-642-81955-1
eBook Packages: Springer Book Archive