Pages that link to "Item:Q1854521"
From MaRDI portal
The following pages link to The complexity of propositional linear temporal logics in simple cases (Q1854521):
Displaying 36 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Temporal BI: proof system, semantics and translations (Q391122) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- On regular temporal logics with past (Q977176) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- Mu-calculus path checking (Q1045942) (← links)
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
- On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
- Algorithms for monitoring real-time properties (Q1647773) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- The complexity of counting models of linear-time temporal logic (Q1745344) (← links)
- Past is for free: On the complexity of verifying linear temporal properties with past (Q1889855) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- On the complexity of linear temporal logic with team semantics (Q2193280) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
- Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
- The tractability of model checking for LTL (Q2946630) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- Weak Kripke Structures and LTL (Q3090846) (← links)
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457) (← links)
- (Q4412853) (← links)
- Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- AN NP-COMPLETE FRAGMENT OF LTL (Q5462673) (← links)
- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers (Q5505598) (← links)
- Embedding theorems for LTL and its variants (Q5740619) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)