A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Search Technique for Clause Interconnectivity Graphs
IEEE Transactions on Computers
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Compressing Propositional Refutations
Electronic Notes in Theoretical Computer Science (ENTCS)
Introduction Tutorial on Resolution
IEEE Transactions on Computers
Proof Identity for Classical Logic: Generalizing to Normality
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Proof Search for the First-Order Connection Calculus in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Path resolution with link deletion
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Theorem proving in type theory
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
What is the problem with proof nets for classical logic?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
| Hi-index | 14.98 |
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.