Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Abstract. It is widely believed that a family n of unsatis able formulae de ned by Cook and Reckhow Proc. of the ACM Symp. on Theory of Comp. 1974] gives a lower bound of O (22n) on the proof size with analytic tableaux. This claim plays a key role in the proof that tableaux cannot polynomially simulate tree resolution.
Handbook of Tableau Methods, Springer 1999
TABLEAU METHODS FOR CLASSICAL PROPOSITIONAL LOGICUniversity of Oxford, PRG technical monographs
Investigations into the complexity of some propositional calculi1990 •
Journal of Logic and Computation
The Taming of the Cut. Classical Refutations with Analytic Cut1994 •
Studia Logica - An International Journal for Symbolic Logic
The relative complexity of analytic tableaux and SL-resolution1993 •
2007 •
182 Ian Horrocks, Ullrich Hustadt, Ulrike Sattler, and Renate Schmidt axioms (background theories), and NExpTime-complete for Kn extended with converse modalities, graded modalities and nominals. Some may regard these results as discouraging and the question arises whether automated computation with such logics can be feasible in practice.
2005 •
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (eg, configuration and information integration), they are perhaps best known as the basis for widely used ontology languages such as OWL (now a W3C recommendation). This decision was motivated by a requirement that key inference problems be decidable, and that it should be possible to provide reasoning services to support ontology design and deployment.
The Bulletin of Symbolic Logic
The complexity of propositional proofs1995 •
Formal Methods in System Design
Accelerating tableaux proofs using compact representations1994 •
Journal of Automated Reasoning
Controlled integration of the cut rule into connection tableau calculi1994 •
Journal of Logic, Language and Information
Are Tableaux an Improvement on Truth-Tables? Cut-free Proofs and Bivalence1990 •
2009 •
Logical Foundations of Computer Science
Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings2007 •
2009 •
2008 •
Preliminary proceedings of Advances in Modal Logic (AIML-2004)
Strong completeness for non-compact hybrid logics2004 •
Logic Journal of IGPL
Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge2013 •
Annals of mathematics and artificial intelligence, Vol. 6, 157-168
The relative complexity of resolution and cut-free gentzen systems1992 •
2011 •
ACM Transactions on Computational Logic
Tableau-based decision procedures for logics of strategic ability in multiagent systems2009 •
Autonomous Agents and Multi-Agent Systems
Modal tableaux for verifying stream authentication protocols2009 •
1999 •
Lecture Notes in Computer Science
Incremental Closure of Free Variable Tableaux2001 •
Journal of Automated Reasoning
Using Resolution for Testing Modal Satisfiability and Building Models2002 •
Lecture Notes in Computer Science
A Fibred Tableau Calculus for Modal Logics of Agents2006 •