Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
Information and Computation
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
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
Goal Directed Strategies for Paramodulation
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Improving Transformation Systems for General E-Unification
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
An Improved General E-Unification Method
Proceedings of the 10th International Conference on Automated Deduction
Elimination of Equality via Transformation with Ordering Constraints
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Model elimination and connection tableau procedures
Handbook of automated reasoning
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Connection tableaux with lazy paramodulation
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Evidence algorithm and system for automated deduction: a retrospective view
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
| Hi-index | 0.00 |
It is well known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tableau calculus for logic with equality. This calculus is based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations. Our calculus uses ordering constraints and a certain form of the basicness restriction.