This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Refutations by Matings
August 1976 (vol. 25 no. 8)
pp. 801-807
P.B. Andrews, Carnegie-Mellon University
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.
Index Terms:
Automatic theorem proving, clause-occurrence, cycle, first-order logic, mating, merge, refutation, resolution, unsatisfiability.
Citation:
P.B. Andrews, "Refutations by Matings," IEEE Transactions on Computers, vol. 25, no. 8, pp. 801-807, Aug. 1976, doi:10.1109/TC.1976.1674698
Usage of this product signifies your acceptance of the Terms of Use.