The complexity of model checking for propositional default logics

Paolo Liberatore, Marco Schaerf
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Data &amp; Knowledge Engineering</a> </i> &nbsp;
Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional interpretation is a model of a default theory for some of the variants of default logic presented in the literature. We prove that all the analyzed variants have the same complexity and that this problem is in general Σ p 2 complete, while it is coNP complete under some restrictions on the form of the defaults.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/j.datak.2005.03.002</a> <a target="_blank" rel="external noopener" href="">fatcat:iyd7vci7njeytdxyvaboulzogq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>