Default Logic and Bounded Treewidth

06/28/2017
by   Johannes K. Fichte, et al.
0

In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-incidence 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 or can even be used to enumerate all generating defaults that lead to stable extensions. We show that, for input theories whose semi-incidence graph has bounded treewidth, our algorithm decides whether a theory has a stable extension in linear time and enumerates all characteristic generating defaults with linear delay.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset