Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
Equality Elimination for the Tableau Method
DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Integration of Equality Reasoning into the Disconnection Calculus
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning 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
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Incremental Closure of Free Variable Tableaux
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
Living Book -- Deduction, Slicing, and Interaction
Journal of Automated Reasoning
AI Communications
System Description: E- KRHyper
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Applications of automated reasoning
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Blocking and other enhancements for bottom-up model generation methods
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
The model evolution calculus with equality
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
LogAnswer - A Deduction-Based Question Answering System (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Novel Architecture for Situation Awareness Systems
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Logical Ontology Validation Using an Automatic Theorem Prover
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Anaphora resolution involving interactive knowledge acquisition
CNL'09 Proceedings of the 2009 conference on Controlled natural language
First-order tableaux in applications
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
System description: E-KRHyper 1.4: extensions for unique names and description logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified simplification rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too.