Sciweavers

Share
LATA
2012
Springer

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

6 years 12 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, the extension existence problem for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems. On the other hand, we exhibit, for each of the above problems, families of instances of a very simple structure that, for a wide range of different parameterizations, do not have efficient fixed-parameter algorithms (even in the sense of the large class XPnu), unless P = NP.
Arne Meier, Johannes Schmidt, Michael Thomas, Heri
Added 25 Apr 2012
Updated 25 Apr 2012
Type Journal
Year 2012
Where LATA
Authors Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
Comments (0)
books