Solving #SAT Using Vertex Covers
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 the 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 clique-width, 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 clustering-width and bounded clique-width, treewidth, and branchwidth.
KeywordsPolynomial Time Base Class Vertex Cover Conjunctive Normal Form Truth Assignment
Unable to display preview. Download preview PDF.
- 1.Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian Inference. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 340–351 (2003)Google Scholar
- 3.Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, DePaul University, Chicago IL (2005)Google Scholar
- 7.Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science, Springer, Heidelberg (1999)Google Scholar
- 8.Fischer, E., Makowsky, J.A., Ravve, E.R.: Counting truth assignments of formulas of bounded tree-width or clique-width. Discr. Appl. Math. (to appear)Google Scholar
- 10.Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. WG 1999 11(3), 423–443 (2000), Selected papers from the Workshop on Graph-Theoretical Aspects of Computer Science (WG 1999), Part 1 (Ascona)Google Scholar
- 13.Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems (April 2006) (submitted)Google Scholar
- 14.Interian, Y.: Backdoor sets for random 3-SAT. In: Informal Proceedings of SAT 2003, pp. 231–238 (2003)Google Scholar
- 16.Kilby, P., Slaney, J.K., Thiébaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI 2005), pp. 1368–1373 (2005)Google Scholar
- 17.Kleine Büning, H., Zhao, X.: Satisfiable formulas closed under replacement. In: Proceedings for the Workshop on Theory and Applications of Satisfiability. Electronic Notes in Discrete Mathematics, vol. 9, Elsevier Science Publishers, North-Holland (2001)Google Scholar
- 19.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. In: Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, Oxford (2006)Google Scholar
- 20.Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to Horn and binary clauses. In: Informal Proceedings of SAT 2004, pp. 96–103 (2004)Google Scholar
- 21.Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory, Ser. B (to appear)Google Scholar
- 24.Ruan, Y., Kautz, H.A., Horvitz, E.: The backdoor key: A path to understanding problem hardness. In: Proceedings of the 19th National Conference on Artificial Intelligence, 16th Conference on Innovative Applications of Artificial Intelligence, pp. 124–130. AAAI Press / The MIT Press (2004)Google Scholar
- 26.Szeider, S.: Backdoor sets for DLL subsolvers. Journal of Automated Reasoning (in press, 2005)Google Scholar
- 28.Williams, R., Gomes, C., Selman, B.: On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In: Informal Proceedings of SAT 2003, pp. 222–230 (2003)Google Scholar