The Complexity of Analytic Tableaux

Journal of Symbolic Logic 71 (3):777 - 790 (2006)
Abstract
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1154698576
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,781
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Analytic Cut Trees.Carlo Cellucci - 2000 - Logic Journal of the IGPL 8 (6):733-750.
Are Tableaux an Improvement on Truth-Tables?Marcello D'Agostino - 1992 - Journal of Logic, Language and Information 1 (3):235-252.
Paraconsistency and Analyticity.Carlos A. OLLER - 1999 - Logic and Logical Philosophy 7 (1):91-99.
Modal Tableaux for Reasoning About Diagrams.Luis Fariñas del Cerro & Olivier Gasquet - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):169-184.
Körner's Criterion of Relevance and Analytic Tableaux.Joachim Schröder - 1992 - Journal of Philosophical Logic 21 (2):183 - 192.
Added to PP index
2010-08-24

Total downloads
26 ( #202,894 of 2,199,707 )

Recent downloads (6 months)
1 ( #300,206 of 2,199,707 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature