Skip to main content
SpringerLink
Log in

Algorithms for Propositional Model Counting

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4790))

Abstract

We present algorithms for the propositional model counting problem #SAT. The algorithms are based on tree-decompositions of graphs associated with the given CNF formula, in particular primal, dual, and incidence graphs. We describe the algorithms in a coherent fashion that admits a direct comparison of their algorithmic advantages. We analyze and discuss several aspects of the algorithms including worst-case time and space requirements and simplicity of implementation. The algorithms are described in sufficient detail for making an implementation reasonably easy.

Research supported by the EPSRC, project EP/E001394/1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)

    MATH  MathSciNet  Google Scholar 

  5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  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)

    Google Scholar 

  12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    Google Scholar 

  13. Fürer, M.: Faster integer multiplication. In: STOC 2007, pp. 57–66. ACM Press, New York (2007)

    Chapter  Google Scholar 

  14. Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences 64(3), 579–627 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gottlob, G., Scarcello, F., Sideri, M.: Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence 138(1-2), 55–86 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: SODA 2006, pp. 289–298. ACM Press, New York (2006)

    Chapter  Google Scholar 

  17. Kloks, T.: Treewidth: Computations and Approximations. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  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)

    Google Scholar 

  19. Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61(2), 302–332 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  20. Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics 8 (2001)

    Google Scholar 

  21. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  23. Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B 96(4), 514–528 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  24. Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B 52(2), 153–190 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  25. Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence 82(1-2), 273–302 (1996)

    Article  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  27. Schönhage, A., Strassen, V.: Schnelle Multiplikation ganzer Zahlen. Computing 7, 281–292 (1971)

    Article  MATH  Google Scholar 

  28. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189–201 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  29. Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB 1981, pp. 81–94. IEEE Computer Society Press, Los Alamitos (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Durham University, UK

    Marko Samer & Stefan Szeider

Authors
  1. Marko Samer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Szeider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Samer, M., Szeider, S. (2007). Algorithms for Propositional Model Counting. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75560-9_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75558-6

  • Online ISBN: 978-3-540-75560-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation