Exact phase transitions and approximate algorithm of #CSP

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1790-1791

  Huang, Ping ^a   Yin, Minghao ^a   Xu, Ke ^b  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80055046834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Baileya, D. D., Dalmaub, V., and Kolaitisa, P. G. 2007. Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics 155: 1627-1639.
2. Bayardo Jr., R. J., and Pehoushek, J. D. 2000. Counting models using connected components. In Proceedings of AAAI-00, 157-162.
3. Gent I., MacIntyre E., Prosser P., Smith B. M., Walsh T. 2001. Random Constraint Satisfaction: Flaws and Structure. Constraints 6(4): 345-372. (Pubitemid 32820492)
4. Gomes, C. P., Hoeve, W. J. V., Sabharwal, A., and Selman B. 2007. Counting CSP Solutions Using Generalized XOR Constraints. In Proceedings of AAAI'07, 204-209.
5. Gomes, C. P., Sabharwal A., Selman B. 2006. Model Counting: A New Strategy for Obtaining Good Bounds. In Proceedings of AAAI 2006, 54-61.
6. Sang, T., Bacchus F., Beame P, Kautz H.A. and Pitassi T. 2004. Combining Component Caching and Clause Learning for Effective Model Counting. SAT 2004.
7. Xu, K., Boussemart, F.; Hemery, F.; and Lecoutre C. 2007. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial Intelligence 171(8-9).
8. Xu, K., and Li, W. 2000: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research 12: 93-103.
9. Xu, K., and Li, W. 2006. Many Hard Examples in Exact Phase Transitions, Theoretical Computer Science 355: 291-302.
10. Wei W., Selman B. 2005. A New Approach to Model Counting. In Proceedings of SAT, 324-339.