Determining the Number of Solutions to Binary CSP Instances-Reference-Cited by-同舟云学术

Determining the Number of Solutions to Binary CSP Instances

Published:2002 Issue: Volume: Page:327-340
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Angelsmark Ola,Jonsson Peter,Linusson Svante,Thapper Johan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46135-3_22

Reference24 articles.

1. 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:121–123, 1979.

2. R. Bayardo 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-2000), pages 157–162, 2000.

3. M. Cooper, D. A. Cohen, and P. G. Jeavons. Characterising tractable constraints. Artificial Intelligence, 65(2):347–361, 1994.

4. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125:1–12, 1996.

5. V. Dahllöf and P. Jonsson. An algorithm for counting maximum weighted independent sets and its applications. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2002), pages 292–298, 2002.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems;Principles and Practice of Constraint Programming – CP 2003;2003