First-order logic and automated theorem proving
First-order logic and automated theorem proving
The resolution calculus
A rational and efficient algorithm for view deletion in databases
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
The Tableau-based Theorem Prover 3TAP Version 4.0
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
Journal of Automated Reasoning
Ordered Semantic Hyper Tableaux
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
A Confluent Connection Calculus
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Incremental Closure of Free Variable Tableaux
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
Hyperresolution for guarded formulae
Journal of Symbolic Computation - Special issue: First order theorem proving
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
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
Journal of Symbolic Computation
I-terms in ordered resolution and superposition calculi: retrieving lost completeness
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Hyper tableaux — the third version
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Optimizing the evaluation of XPath using description logics
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
| Hi-index | 0.00 |
"Hyper tableau" is a sound and complete calculus for first-order clausal logic. The present paper introduces an improvement which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses. This guessing is now replaced by a unification-driven technique. The calculus is presented in detail, which includes a completeness proof. Completeness is proven by using a novel approach to extract a model from an open branch. This enables semantical redundancy criteria which are not present in related approaches.