Automation of Reasoning pp 85-101 | Cite as
Resolution with Merging
Chapter
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.
Key Words and Phrases
automatic theorem proving mechanical mathematics logic predicate calculus resolution resolvent proof strategy refutation set of support clause mergePreview
Unable to display preview. Download preview PDF.
Reference
- [WM]G.A. Wilson and J. Minker, “Resolution, Refinements, and Search Strategies: A Comparative Study”, IEEE Transactions on Computers C-25 (1976), 782–801.Google Scholar
Copyright information
© Association for Computing Machinery, Inc. 1968