The Complexity of Generalized Satisfiability for Linear Temporal Logic
From MaRDI portal
Publication:3623013
DOI10.2168/LMCS-5(1:1)2009zbMath1183.03017OpenAlexW2951449870MaRDI QIDQ3623013
Ilka Schnoor, Heribert Vollmer, Michael Bauland, Henning Schnoor, Thomas Schneider
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-5(1:1)2009
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items
From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Bounded variability of metric temporal logic ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Lewis dichotomies in many-valued logics ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Backdoors for linear temporal logic ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Weak Kripke Structures and LTL ⋮ The model checking fingerprints of CTL operators
