Algorithms for propositional model counting

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

Volumn 4790 LNAI, Issue , 2007, Pages 484-498

  Samer, Marko ^a   Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

INCIDENCE GRAPHS; PROPOSITIONAL MODEL;

PROBLEM SOLVING;

EID: 38149027601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75560-9_35     Document Type: Conference Paper

References (29)

1. Aho, A. V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms chapter 1, Models of computation, pp. 1-41. Addison-Wesley, Reading (1974)
2. Aspvall, B., Proskurowski, A., Telle, J.A.: Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27(3-4), 382-394 (2000)
3. Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian inference. In: FOCS 2003, pp. 340-351. IEEE Computer Society Press, Los Alamitos (2003)
4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1-21 (1993)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305-1317 (1996)
6. Bodlaender, H.L.: Discovering treewidth. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1-16. Springer, Heidelberg (2005)
7. Cohen, D., Jeavons, P., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In: IJCAI 2005, pp. 72-77. Professional Book Center (2005)
8. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33(2), 125-150 (2000)
9. Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1-2), 23-52 (2001)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
11. Fischer, E., Makowsky, J.A., Ravve, E.R.: Counting truth assignments of formulas of bounded tree-width or clique-width. Discrete Applied Mathematics (in press)
12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
13. Fürer, M.: Faster integer multiplication. In: STOC 2007, pp. 57-66. ACM Press, New York (2007)
14. Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64(3), 579-627 (2002)
15. Gottlob, G., Scarcello, F., Sideri, M.: Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence 138(1-2), 55-86 (2002)
16. Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: SODA 2006, pp. 289-298. ACM Press, New York (2006)
17. Kloks, T.: Treewidth: Computations and Approximations. Springer, Heidelberg (1994)
18. Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, chapter 4.3.3 How fast can we multiply? 3rd edn., vol. 2, pp. 294-318. Addison-Wesley, Reading (1998)
19. Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61(2), 302-332 (2000)
20. Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics, 8 (2001)
21. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
22. Nishimura, N., Ragde, P., Szeider, S.: Solving #SAT using vertex covers. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 396-409. Springer, Heidelberg (2006)
23. Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B 96(4), 514-528 (2006)
24. Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B 52(2), 153-190 (1991)
25. Roth,D.: On the hardness of approximate reasoning. Artificial Intelligence 82(1-2), 273-302 (1996)
26. Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 499-513. Springer, Heidelberg (2006)
27. Schönhage, A., Strassen, V.: Schnelle Multiplikation ganzer Zahlen. Computing 7, 281-292 (1971)
28. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189-201 (1979)
29. Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB 1981, pp. 81-94. IEEE Computer Society Press, Los Alamitos (1981)