September 2006 The complexity of analytic tableaux
Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
J. Symbolic Logic 71(3): 777-790 (September 2006). DOI: 10.2178/jsl/1154698576


The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial.


Download Citation

Noriko H. Arai. Toniann Pitassi. Alasdair Urquhart. "The complexity of analytic tableaux." J. Symbolic Logic 71 (3) 777 - 790, September 2006.


Published: September 2006
First available in Project Euclid: 4 August 2006

zbMATH: 1109.03066
MathSciNet: MR2250820
Digital Object Identifier: 10.2178/jsl/1154698576

Rights: Copyright © 2006 Association for Symbolic Logic


This article is only available to subscribers.
It is not available for individual sale.

Vol.71 • No. 3 • September 2006
Back to Top