Counting satisfying assignments in 2-SAT and 3-SAT

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

Volumn 2387, Issue , 2002, Pages 535-543

  Dahllöf, Vilhelm ^a   Jonsson, Peter ^a   Wahlström, Magnus ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BEST-KNOWN ALGORITHMS; RUNNING-IN; SATISFYING ASSIGNMENTS;

COMBINATORIAL MATHEMATICS;

EID: 84949761666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_57     Document Type: Conference Paper

References (14)

1. R. J. Bayardo Jr. and J. Pehoushek. Counting models using connected components. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), pages 157–162. AAAI Press, 2000.
2. E. Birnbaum and E. L. Lozinskii. The good old Davis-Putnam procedure helps counting models. Journal of Artificial Intelligence Research, 10:457–477, 1999.
3. V. Dahllöf and P. Jonsson. An algorithm for counting maximum weighted independent sets and its applications. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2002), pages 292–298, 2002.
4. O. Dubois. Counting the number of solutions for instances of satisfiability. Theoretical Computer Science, 81(1):49–64, 1991.
5. L. Goldberg and M. Jerrum. Counting unlabelled subtrees of a tree is #P-complete. LMS Journal of Computation and Mathematics, 3:117–124, 2000.
6. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison- Wesley, Reading, MA, USA, second edition, 1994.
7. C. S. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity, 9(1):52–72, 2000.
8. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, and R. E. Stearns. The complexity of planar counting problems. SIAM Journal on Computing, 27(4):1142–1167, 1998.
9. D. Kozen. The design and analysis of algorithms. Springer-Verlag, 1992.
10. M. L. Littman, T. Pitassi, and R. Impagliazzo. On the complexity of counting satisfying assignments. Unpublished manuscript.
11. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82(1–2):273–302, 1996.
12. S. P. Vadhan. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing, 31(2):398–427, 2001.
13. L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410–421, 1979.
14. W. Zhang. Number of models and satisfiability of sets of clauses. Theoretical Computer Science, 155(1):277–288, 1996.