A machine program for theorem-proving
Communications of the ACM
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of these clauses that can be shown to be propositionally unsatisfiable. In recent years, this approach has been refined in several directions, leading to both tableau-based methods, such as the Disconnection Tableau Calculus, and saturation-based methods, such as Primal Partial Instantiation and Resolution-based Instance Generation. We investigate the relationship between these calculi and answer the question to what extent refutation or consistency proofs in one calculus can be simulated in another one.