Information and Computation
The undecidability of simultaneous rigid E-unification
Theoretical Computer Science
Paramodulation with built-in AC-theories and symbolic constraints
Journal of Symbolic Computation
Solution of the Robbins Problem
Journal of Automated Reasoning
What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
Hyper Tableau - The Next Generation
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Completion-Based Method for Mixed Universal and Rigid E-Unification
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Incremental Closure of Free Variable Tableaux
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
Handbook of automated reasoning
Integration of Equality Reasoning into the Disconnection Calculus
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Connection Tableaux with Lazy Paramodulation
Journal of Automated Reasoning
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Saturation up to redundancy for tableau and sequent calculi
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Connection tableaux with lazy paramodulation
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [2,15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7].