Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Flum, Martin Grohe (2006)
Parameterized Complexity Theory
J. Guéron, Jacqueline Lecarme (2008)
Time and Modality
A. Meier, Thomas Schneider (2011)
Generalized Satisfiability for the Description Logic ALCArXiv, abs/1103.0853
Elmar BAPhler, N. Creignou, Matthias Galota, S. Reith, Henning Schnoor, H. Vollmer (2010)
COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITSLogical Methods in Computer Science, 8
G. Gottlob, R. Pichler, Fang Wei-Kleiner (2006)
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Saul Kripke (2012)
Semantical Considerations on Modal Logic
M. Praveen (2010)
Does Treewidth Help in Modal Satisfiability?
E. Clarke, E. Emerson (1981)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Phokion Kolaitis, Moshe Vardi (1998)
Conjunctive-query containment and constraint satisfactionProceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A. Meier, Johannes Schmidt, Michael Thomas, H. Vollmer (2011)
On the Parameterized Complexity of Default Logic and Autoepistemic LogicArXiv, abs/1110.0623
M. Samer, Stefan Szeider (2006)
Constraint satisfaction with bounded treewidth revisitedJ. Comput. Syst. Sci., 76
A. Meier, M. Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss (2009)
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I
N. Pippenger (1997)
Theories of computability
Emil Post (1942)
The two-valued iterative systems of mathematical logicAnnals of Mathematics Studies
E. Emerson (1991)
Temporal and Modal Logic
E. Emerson, Joseph Halpern (1982)
Decision procedures and expressiveness in the temporal logic of branching time
Michael Elberfeld, A. Jakoby, Till Tantau (2010)
Logspace Versions of the Theorems of Bodlaender and Courcelle2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Olaf Beyersdorff, A. Meier, M. Mundhenk, Thomas Schneider, Michael Thomas, H. Vollmer (2009)
Model Checking CTL is Almost Always Inherently Sequential2009 16th International Symposium on Temporal Representation and Reasoning
Stefan Szeider (1998)
Parameterized Complexity
Stephane Demri, P. Schnoebelen (1998)
The Complexity of Propositional Linear Temporal Logics in Simple CasesInf. Comput., 174
A. Meier, Michael Thomas, H. Vollmer, M. Mundhenk (2008)
The Complexity of Satisfiability for Fragments of CTL and CTL*
F. Kröger (1987)
Temporal Logic of Programs, 8
(2015)
Article 1, Publication date
M. Fischer, R. Ladner (1979)
Propositional Dynamic Logic of Regular ProgramsJ. Comput. Syst. Sci., 18
P. Blackburn, M. Rijke, Y. Venema (2001)
Modal Logic, 53
C. Chekuri, A. Rajaraman (1997)
Conjunctive query containment revisited: Extended Abstract
E. Hemaspaandra, Henning Schnoor, Ilka Schnoor (2006)
Generalized modal satisfiabilityJ. Comput. Syst. Sci., 76
M. Samer, Stefan Szeider (2006)
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence TreewidthArXiv, abs/cs/0610174
Michael Bauland, Elmar Böhler, N. Creignou, S. Reith, Henning Schnoor, H. Vollmer (2010)
The Complexity of Problems for Quantified ConstraintsTheory of Computing Systems, 47
B. Courcelle, J. Engelfriet (2012)
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic ApproachBull. EATCS, 108
C. Chekuri, A. Rajaraman (1997)
Conjunctive query containment revisited
Joseph Halpern (1995)
The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal LogicArtif. Intell., 75
J. Flum, Martin Grohe (2006)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Olaf Beyersdorff, A. Meier, Michael Thomas, H. Vollmer (2008)
The complexity of reasoning for fragments of default logicArXiv, abs/0808.3884
N. Creignou, A. Meier, H. Vollmer, Michael Thomas (2010)
The Complexity of Reasoning for Fragments of Autoepistemic LogicACM Trans. Comput. Log., 13
H. Gaifman (1982)
On Local and Non-Local PropertiesStudies in logic and the foundations of mathematics, 107
Martin Lück (2015)
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree LogicArXiv, abs/1510.08786
H. Lewis (1979)
Satisfiability problems for propositional calculiMathematical systems theory, 13
Parametrised Complexity of Satisfiability in Temporal Logic ¨ ¨ MARTIN LUCK, ARNE MEIER, and IRENA SCHINDLER, Leibniz Universitat Hannover We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlike structures are discussed, and corresponding notions of treewidth and pathwidth are introduced. As an application for such structures, we present a classification in terms of parametrised complexity of the satisfiability problem, where we make use of Courcelle's famous theorem for recognition of certain classes of structures. Our classification shows a dichotomy between W[1]-hard and fixed-parameter tractable operator fragments almost independently of the chosen graph representation. The only fragments that are proven to be fixed-parameter tractable (FPT) are those that are restricted to the X operator. By investigating Boolean operator fragments in the sense of Post's lattice, we achieve the same complexity as in the unrestricted case if the set of available Boolean functions can express the function "negation of the implication." Conversely, we show containment in FPT for almost all other clones. CCS Concepts: · Theory of computation Complexity theory and logic; Complexity classes; Additional Key Words and Phrases: Parametrised complexity,
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jan 20, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.