We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated parameterizationâ€¦ (More)

In this paper, we study Reiterâ€™s propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamicâ€¦ (More)

In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of theâ€¦ (More)

We present a complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated parameterization isâ€¦ (More)

In this paper, we introduce a notion of backdoors to Reiterâ€™s propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised byâ€¦ (More)

We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlikeâ€¦ (More)

We investigate the application of Courcelleâ€™s theorem and the logspace version of Elberfeld et al. in the context of non-monotonic reasoning. Here we formalize the implication problem forâ€¦ (More)

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â€¦ (More)