Backdoors for linear temporal logic
type: Item
instance of: scholarly article
title: Backdoors for linear temporal logic
zbMATH Open document ID: 1411.68050
author: Arne Meier
author: Sebastian Ordyniak
author: M. S. Ramanujan
author: Irena Schindler
published in: Algorithmica
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7023723
zbMATH Keywords: linear temporal logic
zbMATH Keywords: parameterized complexity
zbMATH Keywords: backdoor sets
MaRDI profile type: Publication
full work available at URL: s00453-018-0515-5
OpenAlex ID: W2891208999
Wikidata QID: Q64937504
cites work: A kernelization algorithm for \(d\)-hitting set
cites work: The Complexity of Clausal Fragments of LTL
cites work: The Complexity of Generalized Satisfiability for Linear Temporal Logic
cites work: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
cites work: Tight lower bounds for certain parameterized NP-hard problems
cites work: Improved upper bounds for vertex cover
cites work: Q3336675
cites work: The complexity of propositional linear temporal logics in simple cases
cites work: Tradeoffs in the Complexity of Backdoor Detection
cites work: Backdoors in the Context of Learning
cites work: Fundamentals of parameterized complexity
cites work: Augmenting tractable fragments of abstract argumentation
cites work: Decision procedures and expressiveness in the temporal logic of branching time
cites work: A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution
cites work: Clausal temporal resolution
cites work: Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
cites work: Backdoors to Satisfaction
cites work: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
cites work: Q5339289
cites work: Backdoors to planning
cites work: Model checking of safety properties
cites work: Past is for free: On the complexity of verifying linear temporal properties with past
cites work: Backdoors for Linear Temporal Logic
cites work: On the size of refutation Kripke models for some linear modal and tense logics
cites work: Satisfiability of acyclic and almost acyclic CNF formulas
cites work: Backdoor sets of quantified Boolean formulas
cites work: Theory and Applications of Satisfiability Testing
DBLP publication ID: journals/algorithmica/MeierORS19
DOI: 10.1007/S00453-018-0515-5
description: scientific article; zbMATH DE number 7023723