DocumentCode
1133192
Title
Refutations by Matings
Author
Andrews, Peter B.
Author_Institution
Carnegie-Mellon University
Issue
8
fYear
1976
Firstpage
801
Lastpage
807
Abstract
Occurrences of literals in the initial clauses of a refutation by resolution (with each clause-occurrence used only once) are mated iff their descendants are resolved with each other. This leads to an abstract notion of a mating as a relation between: occurrences of literals in a set of clause-occurrences. The existence of many refutations with the same mating leads to wasteful redundancy in the search for a refutation, so it is natural to focus on the essential problem of finding appropriate matings.
Keywords
Automatic theorem proving, clause-occurrence, cycle, first-order logic, mating, merge, refutation, resolution, unsatisfiability.; Bismuth; Conferences; Costs; Logic; Tellurium; Writing; Automatic theorem proving, clause-occurrence, cycle, first-order logic, mating, merge, refutation, resolution, unsatisfiability.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1976.1674698
Filename
1674698
Link To Document