JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
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
Hyper Tableau - The Next Generation
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Completion-Based Method for Mixed Universal and Rigid E-Unification
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Confluent Connection Calculus
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Model elimination and connection tableau procedures
Handbook 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
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Depth-first proof search without backtracking for free-variable clausal tableaux
Journal of Symbolic Computation - Special issue: First order theorem proving
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
A Bottom-Up Approach to Clausal Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
Journal of Symbolic Computation
KeY: a formal method for object-oriented systems
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Proving programs incorrect using a sequent calculus for Java dynamic logic
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Non-termination checking for imperative programs
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Integrating verification and testing of object-oriented software
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
Satisfiability solving and model generation for quantified first-order logic formulas
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Declarative programming for agent applications
Autonomous Agents and Multi-Agent Systems
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
A semantic completeness proof for tamed
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Consistency of variable splitting in free variable systems of first-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Embedding static analysis into tableaux and sequent based frameworks
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Incremental variable splitting
Journal of Symbolic Computation
| Hi-index | 0.00 |
This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee completeness. If the correct instantiation is hard to find, this can lead to a significant amount of duplicated work. Incremental Closure is a way of organizing the search for closing instantiations that avoids this inefficiency.