Backdoors for linear temporal logic
From MaRDI portal
Publication:1725638
DOI10.1007/s00453-018-0515-5zbMath1411.68050OpenAlexW2891208999WikidataQ64937504 ScholiaQ64937504MaRDI QIDQ1725638
Arne Meier, M. S. Ramanujan, Irena Schindler, Sebastian Ordyniak
Publication date: 14 February 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-018-0515-5
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Satisfiability of acyclic and almost acyclic CNF formulas
- Improved upper bounds for vertex cover
- A kernelization algorithm for \(d\)-hitting set
- Backdoor sets of quantified Boolean formulas
- On the size of refutation Kripke models for some linear modal and tense logics
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
- Augmenting tractable fragments of abstract argumentation
- The complexity of propositional linear temporal logics in simple cases
- Past is for free: On the complexity of verifying linear temporal properties with past
- Decision procedures and expressiveness in the temporal logic of branching time
- Backdoors to planning
- Tight lower bounds for certain parameterized NP-hard problems
- The Complexity of Clausal Fragments of LTL
- Backdoors to Satisfaction
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
- Tradeoffs in the Complexity of Backdoor Detection
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- Backdoors in the Context of Learning
- A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution
- Backdoors for Linear Temporal Logic
- Theory and Applications of Satisfiability Testing
- Clausal temporal resolution
- Model checking of safety properties
This page was built for publication: Backdoors for linear temporal logic
