Name
Abstract | ||
|---|---|---|
In the present paper we introduce the notion of strong backdoors into the field of temporal logic for the CNF-fragment of linear temporal logic introduced by Fisher. We study the parameterised complexity of the satisfiability problem parameterised by the size of the backdoor. We distinguish between backdoor detection and evaluation of backdoors into the fragments of horn and krom formulas. Here we classify the operator fragments of globally-operators for past or future, and the combination of both. Detection is shown to be in FPT whereas the complexity of evaluation behaves different. We show that for krom formulas the problem is paraNP-complete. For horn formulas the complexity is shown to be either fixed parameter tractable or paraNP-complete depending on the considered operator fragment. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Logic in Computer Science | Discrete mathematics,Boolean satisfiability problem,Algorithm,Linear temporal logic,Backdoor,Operator (computer programming),Temporal logic,Mathematics |
DocType | Volume | Citations |
Journal | abs/1602.04934 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arne Meier | 1 | 126 | 19.00 |
| Sebastian Ordyniak | 2 | 176 | 30.27 |
| M. S. Ramanujan | 3 | 222 | 28.33 |
| Irena Schindler | 4 | 0 | 0.34 |