Journal of Symbolic Logic 71 (3):777 - 790 (2006)
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)|
References found in this work BETA
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
On the Computational Intractability of Analytic Tableau Methods.Neil Murray & Erik Rosenthal - 1994 - Logic Journal of the IGPL 2 (2):205-228.
Citations of this work BETA
No citations found.
Similar books and articles
The Relative Complexity of Analytic Tableaux and SL-Resolution.André Vellino - 1993 - Studia Logica 52 (2):323 - 337.
Are Tableaux an Improvement on Truth-Tables?Marcello D'Agostino - 1992 - Journal of Logic, Language and Information 1 (3):235-252.
The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus.J. M. Plotkin & John W. Rosenthal - 1982 - Notre Dame Journal of Formal Logic 23 (4):409-426.
Free-Variable Tableaux for Propositional Modal Logics.Bernhard Beckert & Rajeev GorÉ - 2001 - Studia Logica 69 (1):59-96.
Systematization of Finite Many-Valued Logics Through the Method of Tableaux.Walter A. Carnielli - 1987 - Journal of Symbolic Logic 52 (2):473-493.
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.
How to Extend the Semantic Tableaux and Cut-Free Versions of the Second Incompleteness Theorem Almost to Robinson's Arithmetic Q.Dan E. Willard - 2002 - Journal of Symbolic Logic 67 (1):465-496.
Dual Tableaux: Foundations, Methodology, Case Studies.Ewa Orlowska & Joanna Golinska-Pilarek - 2011 - Springer.
Körner's Criterion of Relevance and Analytic Tableaux.Joachim Schröder - 1992 - Journal of Philosophical Logic 21 (2):183 - 192.
Added to index2010-08-24
Total downloads20 ( #235,774 of 2,079,507 )
Recent downloads (6 months)5 ( #179,684 of 2,079,507 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.