Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Fichte, J. K., Hecher, M., & Schindler, I. (2018). Default Logic and Bounded Treewidth. In Language and Automata Theory and Applications (pp. 130–142). Springer. https://doi.org/10.1007/978-3-319-77313-1_10
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 programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (Ext). Our algorithm can even be used to enumerate all generating defaults (EnumSE) that lead to stabl...
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 programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (Ext). Our algorithm can even be used to enumerate all generating defaults (EnumSE) that lead to stable extensions. We show that our algorithm decides Ext in linear time in the input theory and triple exponential time in the treewidth (so-called fixed-parameter linear algorithm). Further, our algorithm solves EnumSE with a pre-computation step that is linear in the input theory and triple exponential in the treewidth followed by a linear delay to output solutions.
en
Project title:
START: Y 698-N23 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF))
-
Research Areas:
außerhalb der gesamtuniversitären Forschungsschwerpunkte: 100%
