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)|
|Through your library||Configure|
Similar books and articles
Carlo Cellucci (2000). Analytic Cut Trees. Logic Journal of the IGPL 8:733-750.
André Vellino (1993). The Relative Complexity of Analytic Tableaux and SL-Resolution. Studia Logica 52 (2):323 - 337.
Marcello D'Agostino (1992). Are Tableaux an Improvement on Truth-Tables? Journal of Logic, Language and Information 1 (3):235-252.
Carlos A. OLLER (1999). Paraconsistency and Analyticity. Logic and Logical Philosophy 7 (1):91-99.
J. M. Plotkin & John W. Rosenthal (1982). The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus. Notre Dame Journal of Formal Logic 23 (4):409-426.
Bernhard Beckert & Rajeev GorÉ (2001). Free-Variable Tableaux for Propositional Modal Logics. Studia Logica 69 (1):59-96.
Walter A. Carnielli (1987). Systematization of Finite Many-Valued Logics Through the Method of Tableaux. Journal of Symbolic Logic 52 (2):473-493.
Luis Fariñas del Cerro & Olivier Gasquet (2006). Modal Tableaux for Reasoning About Diagrams. Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):169-184.
Dan E. Willard (2002). How to Extend the Semantic Tableaux and Cut-Free Versions of the Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. Journal of Symbolic Logic 67 (1):465-496.
Ewa Orlowska & Joanna Golinska-Pilarek (2011). Dual Tableaux: Foundations, Methodology, Case Studies. Springer.
Joachim Schröder (1992). Körner's Criterion of Relevance and Analytic Tableaux. Journal of Philosophical Logic 21 (2):183 - 192.
Francis Jeffry Pelletier (1998). Automated Natural Deduction in Thinker. Studia Logica 60 (1):3-43.
Added to index2010-08-24
Total downloads5 ( #169,891 of 722,765 )
Recent downloads (6 months)1 ( #60,247 of 722,765 )
How can I increase my downloads?