Default Logic and Bounded Treewidth release_i23houjpqvhzbil7rxi4akgfka

by Johannes K. Fichte, Markus Hecher, Irina Schindler

Released as a article .

2017  

Abstract

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 (ExtEnum) 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 ExtEnum 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.
In text/plain format

Archived Files and Locations

application/pdf  654.9 kB
file_akpfy5ccrba4hb4h27rj2spqs4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-06-28
Version   v1
Language   en ?
arXiv  1706.09393v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 15176d14-f1b0-4de9-9ba4-2f42e3d7bd20
API URL: JSON