Solving #SAT using vertex covers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 396-409

  Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Szeider, Stefan ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; OPTIMIZATION; THEOREM PROVING;

BOUNDED CLIQUE WIDTH; BOUNDED CLUSTERING WIDTH; GRAPH PARAMETERS; HYPERGRAPHS;

PROBLEM SOLVING;

EID: 33749538691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_36     Document Type: Conference Paper

References (28)

1. F. Bacchus, S. Dalmao, and T. Pitassi. Algorithms and complexity results for #SAT and Bayesian Inference. In 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), 340-351, 2003.
2. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
3. J. Chen, I. A. Kanj, and G. Xia. Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, DePaul University, Chicago IL, 2005.
4. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst., 33(2):125-150, 2000.
5. B. Courcelle, J. A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discr. Appl. Math., 108(1-2):23-52, 2001.
6. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discr. Appl. Math., 101(1-3):77-114, 2000.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer Verlag, 1999.
8. E. Fischer, J. A. Makowsky, and E. R. Ravve. Counting truth assignments of formulas of bounded tree-width or clique-width. Discr. Appl. Math, to appear.
9. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM J. Comput., 33(4):892-922, 2004.
10. M. C. Golumbic and U. Rotics. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci., 11(3):423-443, 2000. Selected papers from the Workshop on Graph-Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona).
11. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Graph-modeled data clustering: fixed-parameter algorithms for clique generation. Theory Comput. Syst., 38(4):373-392, 2005.
12. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2):55-86, 2002.
13. G. Gottlob and S. Szeider. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. Submitted, April 2006.
14. Y. Interian. Backdoor sets for random 3-SAT. In Informal Proceedings of SAT 2003, 231-238, 2003.
15. K. Iwama. CNF-satisfiability test by counting and polynomial average time. SIAM J. Comput., 18(2):385-391, 1989.
16. P. Kilby, J. K. Slaney, S. Thiébaux, and T. Walsh. 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), 1368-1373, 2005.
17. H. Kleine Büning and X. Zhao. Satisfiable formulas closed under replacement. In Proceedings for the Workshop on Theory and Applications of Satisfiability, volume 9 of Electronic Notes in Discrete Mathematics. Elsevier Science Publishers, North-Holland, 2001.
18. I. Lynce and J. P. Marques-Silva. Hidden structure in unsatisfiable random 3-SAT: An empirical study. In 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 246-251. IEEE Computer Society, 2004.
19. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, 2006.
20. N. Nishimura, P. Ragde, and S. Szeider. Detecting backdoor sets with respect to Horn and binary clauses. In Informal Proceedings of SAT 2004, 96-103, 2004.
21. S. Oum and P. Seymour. Approximating clique-width and branch-width. J. Combin. Theory, Ser. B, to appear.
22. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B, 52(2):153-190, 1991.
23. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2):273-302, 1996.
24. Y. Ruan, H. A. Kautz, and E. Horvitz. 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, 124-130. AAAI Press / The MIT Press, 2004.
25. S. Szeider. On fixed-parameter tractable parameterizations of SAT. In Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers, LNCS, vol. 2919, 188-202. Springer, 2004.
26. S. Szeider. Backdoor sets for DLL subsolvers. Journal of Automated Reasoning, 2005. In press.
27. L. G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8(2):189-201, 1979.
28. R. Williams, C. Gomes, and B. Selman. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In Informal Proceedings of SAT 2003, 222-230, 2003.