2 citations · 2 across the 3 of their papers we have counts for
4 papers
Default Logic and Bounded Treewidth
Johannes K. Fichte, Markus Hecher, Irina Schindler
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…
Strong Backdoors for Default Logic
Johannes K. Fichte, Arne Meier, Irina Schindler
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…
Strong Backdoors for Linear Temporal Logic
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan +1
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 p…
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
Martin Lück, Arne Meier, Irina Schindler
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…