Improved algorithms for counting solutions in constraint satisfaction problems

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

Volumn 2833, Issue , 2003, Pages 81-95

  Angelsmark, Ola ^a   Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

DOMAIN SIZE; RUNNING TIME; STATISTICAL PHYSICS; TIME ALGORITHMS; TIME COMPLEXITY; UPPER BOUND;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33746594987     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_6     Document Type: Article

References (21)

1. O. Angelsmark, P. Jonsson, S. Linusson, and J. Thapper. Determining the number of solutions to a binary CSP instance. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP-2002), Sept. 2002.
2. B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, 8(3):121-123, Mar. 1979.
3. R. J. Bayardo Jr. and J. D. Pehoushek. Counting models using connected components. In Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence AAAI/IAAI, pages 157-162, 2000.
4. R. Beigel. Finding maximum independent sets in sparse and general graphs. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-1999), pages 856-857, 1999.
5. A. Bulatov and V. Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem. Technical report, Computing Laboratory, Oxford University, 2003. Available from web.comlab.ox.ac.uk/oucl/work/andrei.bulatov/ counting.ps.
6. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125:1-12, 1996.
7. V. Dahllöf, P. Jonsson, and M. Wahlström. Counting satisfying assignments in 2-SAT and 3-SAT. In Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON-2002), Singapore, pages 535-543, Aug. 2002.
8. A. Darwiche. On the tractable counting of theory models and its applications to truth maintenance and belief revision. Journal of Applied Non-Classical Logic, 11(1-2):11-34, 2001.
9. O. Dubois. Counting the number of solutions for instances of satisfiability. Theoretical Computer Science, 81(1):49-64, 1991.
10. M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures and Algorithms, 17:260-289, 2000.
11. P. G. Jeavons, D. A. Cohen, and J. K. Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence, 24:51-67, 1998.
12. P. Jégou. Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI-93), pages 731-736, Washington DC, USA, July 1993. American Association for Artificial Intelligence.
13. O. Kullman. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223:1-72, 1999.
14. V. Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1):32-44, Spring 1992.
15. M. L. Littman, T. Pitassi, and R. Impagliazzo. On the complexity of counting satisfying assignments. Unpublished manuscript, 2001.
16. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95-132, 1974.
17. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82:273-302, 1996.
18. T. K. Satish Kumar. A model counting characterization of diagnoses. In Proceedings of the Thirteenth International Workshop on Principles of Diagnosis, pages 70-76, 2002.
19. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8(2):189-201, 1979.
20. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
21. M. Wahlström. An algorithm for #2SAT. Technical report, Department of Computer Science, Linköping, Sweden, 2003. In preparation. Preliminary version available from http://www.ida.liu.se/~magwa/research/num2sat.ps.