Depth-first proof search without backtracking for free-variable clausal tableaux

Authors:
Bernhard Beckert
Affiliations:
Institute for Logic, Complexity and Deduction Systems, Universität Karlsruhe, D-76128 Karlsruhe, Germany
Venue:
Journal of Symbolic Computation - Special issue: First order theorem proving
Year:
2003

Citing 5
Cited 3

HARP: a tableau-based theorem prover

Journal of Automated Reasoning
First-order logic and automated theorem proving (2nd ed.)

First-order logic and automated theorem proving (2nd ed.)
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
Ordered Tableaux: Extensions and Applications

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Incremental Closure of Free Variable Tableaux

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

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
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse the problem of constructing a deterministic proof procedure for free-variable clausal tableaux that performs depth-first proof search without backtracking; and we present a solution based on a fairness strategy. That strategy uses weight orderings and a notion of tableau subsumption to avoid proof cycles and it employs reconstruction steps to handle the destructiveness of free-variable calculi.