On the Parameterized Complexity of Default Logic and Autoepistemic Logic

Abstract

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… (More)
DOI: 10.1007/978-3-642-28332-1_33

Topics

1 Figure or Table

Cite this paper

@inproceedings{Meier2012OnTP, title={On the Parameterized Complexity of Default Logic and Autoepistemic Logic}, author={Arne Meier and Johannes Schmidt and Michael Thomas and Heribert Vollmer}, booktitle={LATA}, year={2012} }