Backdoors for Linear Temporal Logic

DOI10.4230/LIPIcs.IPEC.2016.23zbMath1398.68257arXiv1602.04934OpenAlexW2589788139MaRDI QIDQ4634407

Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler, Arne Meier

Publication date: 10 April 2018

Full work available at URL: https://arxiv.org/abs/1602.04934

zbMATH Keywords

linear temporal logicparameterized complexitybackdoor sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (3)

Backdoor Sets for CSP. ⋮ Backdoors for linear temporal logic ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic

This page was built for publication: Backdoors for Linear Temporal Logic