A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1711.07786v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
[article]
<span title="2018-08-10">2018</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2017-11-21">2017</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v1">arXiv:1711.07786v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/of7kwyyvbvgodfwb4kndojat74">fatcat:of7kwyyvbvgodfwb4kndojat74</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v1">arXiv:1711.07786v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/of7kwyyvbvgodfwb4kndojat74">fatcat:of7kwyyvbvgodfwb4kndojat74</a> </span>
<span title="2018-10-29">2018</span>
<span class="release-stage">accepted</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.23638/lmcs-14(4:10)2018">doi:10.23638/lmcs-14(4:10)2018</a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v3">arXiv:1711.07786v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ptxxstfjnzal7o7c6s5i67o62y">fatcat:ptxxstfjnzal7o7c6s5i67o62y</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.23638/lmcs-14(4:10)2018">doi:10.23638/lmcs-14(4:10)2018</a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v3">arXiv:1711.07786v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ptxxstfjnzal7o7c6s5i67o62y">fatcat:ptxxstfjnzal7o7c6s5i67o62y</a> </span>
Many reasoning problems are based on the problem of satisfiability (SAT). While SAT itself becomes easy when restricting the structure of the formulas in a certain way, the situation is more opaque for more involved decision problems. We consider here the CardMinSat problem which asks, given a propositional formula ϕ and an atom x, whether x is true in some cardinality-minimal model of ϕ. This problem is easy for the Horn fragment, but, as we will show in this paper, remains Θ_2-complete (and
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v2">arXiv:1711.07786v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/darioyhufbcqbazbuiykrn5bbm">fatcat:darioyhufbcqbazbuiykrn5bbm</a>
</span>
more »
... us NP-hard) for the Krom fragment (which is given by formulas in CNF where clauses have at most two literals). We will make use of this fact to study the complexity of reasoning tasks in belief revision and logic-based abduction and show that, while in some cases the restriction to Krom formulas leads to a decrease of complexity, in others it does not. We thus also consider the CardMinSat problem with respect to additional restrictions to Krom formulas towards a better understanding of the tractability frontier of such problems.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831071239/https://arxiv.org/pdf/1711.07786v2.pdf" 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="https://blobs.fatcat.wiki/thumbnail/pdf/b2/77/b2775a14b23bc13581c55af337b4da48cff8cc26.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1711.07786v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>