Talks and Poster Presentations (with Proceedings-Entry):
J. Fichte, M. Hecher, I. Schindler:
"Default Logic and Bounded Treewidth";
Talk: Language and Automata Theory and Applications (LATA),
Ramat Gan, Israel;
- 2018-04-11; in: "12th International Conference Language and Automata theory and Applications (LATA)",
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.
Parameterized algorithms; Tree decompositions; Dynamic programming; Reiterīs default logic; Propositional logic
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Electronic version of the publication:
Project Head Stefan Woltran:
Created from the Publication Database of the Vienna University of Technology.