Equality-based binary resolution
Journal of the ACM (JACM)
HARP: a tableau-based theorem prover
Journal of Automated Reasoning
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
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
A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Journal of Automated Reasoning
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Labelled unit superposition calculi for instantiation-based reasoning
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proof output and transformation for disconnection tableaux
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
The model evolution calculus with equality
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Model Evolution with equality - Revised and implemented
Journal of Symbolic Computation
| Hi-index | 0.00 |
Equality handling has always been a traditional weakness of tableau calculi because the typical refinements of those calculi were not compatible with the most successful methods for equality handling. The disconnection tableau calculus represents a new confluent framework well suited for the integration of a large class of different methods for equality handling, as we demonstrate in this paper. We consider both saturation based and goal-oriented methods for equality handling. We also show how specialized equality handling can affect the properties of the calculus at the example of the well-known regularity condition. All the presented approaches of equality handling have been implemented in the theorem prover DCTP and we present the results of an experimental evaluation.