A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://cs.uwaterloo.ca/~plragde/papers/sharpsat_AI.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Solving #SAT using vertex covers
<span title="2007-09-03">2007</span>
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnqseeosvrf6tnj6sc3lbn2y4e" style="color: black;">Acta Informatica</a>
</i>
Preserved Fulltext
We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoor sets of bounded size; each instantiation of the variables of a strong backdoor set puts the given formula into a class of formulas for which models can be counted in polynomial time. For the backdoor set detection we utilize an efficient vertex cover algorithm applied to a certain "obstruction graph" that we associate with
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-007-0056-x">doi:10.1007/s00236-007-0056-x</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/onhqc2ooj5fxjduv4ubachwn6e">fatcat:onhqc2ooj5fxjduv4ubachwn6e</a>
</span>
more »
... e given formula. This approach gives rise to a new hardness index for formulas, the clustering-width. Our algorithm runs in uniform polynomial time on formulas with bounded clustering-width. It is known that the number of models of formulas with bounded cliquewidth, bounded treewidth, or bounded branchwidth can be computed in polynomial time; these graph parameters are applied to formulas via certain (hyper)graphs associated with formulas. We show that clustering-width and the other parameters mentioned are incomparable: there are formulas with bounded clustering-width and arbitrarily large clique-width, treewidth, and branchwidth. Conversely, there are formulas with arbitrarily large clusteringwidth and bounded clique-width, treewidth, and branchwidth.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829031114/https://cs.uwaterloo.ca/~plragde/papers/sharpsat_AI.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/a8/44/a844a70b8bbdf6502a481c6c035af94d29afe7c1.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-007-0056-x">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>