Uniform solution sampling using a constraint solver as an oracle

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 255-264

  Ermon, Stefano ^a   Gomes, Carla ^a   Selman, Bart ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MODEL; BENCH-MARK PROBLEMS; CONSTRAINT SOLVERS; GIBBS SAMPLING; HARD CONSTRAINTS; SAMPLING SCHEMES; SAMPLING TECHNIQUE; UNIFORM EXPLORATIONS;

ARTIFICIAL INTELLIGENCE; SIMULATED ANNEALING;

LOGIC PROGRAMMING;

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

References (23)

1. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62(1):107-136, 2006.
2. N.N. Madras. Lectures on Monte Carlo Methods. American Mathematical Society, 2002.
3. C.P. Gomes, J. Hoffmann, A. Sabharwal, and B. Selman. From sampling to model counting. In Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI), 2007.
4. L.G. Valiant. The complexity of enumeration and reliability problems. SIAMJournal on Computing, 8:410, 1979.
5. C.P. Gomes, A. Sabharwal, and B. Selman. Nearuniform sampling of combinatorial spaces using xor constraints. Advances In Neural Information Processing Systems, 19:481, 2007.
6. R. Dechter, K. Kask, E. Bin, and R. Emek. Generating random solutions for constraint satisfaction problems. In Proc. 18th National Conference on Artificial Intelligence (AAAI), pages 15-21, 2002.
7. V. Gogate and R. Dechter. Approximate solution sampling (and counting) on and/or spaces. In Principles and Practice of Constraint Programming, pages 534-538. Springer, 2008.
8. W. Wei, J. Erenrich, and B. Selman. Towards efficient sampling: exploiting random walk strategies. In Proc. 19th National Conference on Artifical Intelligence (AAAI), pages 670-676, 2004.
9. H. Poon and P. Domingos. Sound and efficient inference with probabilistic and deterministic dependencies. In Proc. 21st National Conference on Artifical Intelligence (AAAI), volume 21, page 458, 2006.
10. H. Kautz and B. Selman. The state of sat. Discrete Applied Mathematics, 155(12):1514-1524, 2007.
11. V. Gogate and R. Dechter. Samplesearch: A scheme that searches for consistent samples. In Proc. 10th International Conference on Artificial Intelligence and Statistics (AISTATS), 2007.
12. V. Gogate and R. Dechter. Samplesearch: Importance sampling in presence of determinism. Artificial Intelligence, 175(2):694-729, 2011.
13. V. Gogate and R. Dechter. Studies in solution sampling. In Proc 23rd National Conference on Artificial Intelligence (AAAI), volume 1, page 271. AAAI Press, 2008.
14. N. Metropolis, AW Rosenbluth, MN Rosenbluth, AH Teller, and E. Teller. Equations of state calculations by fast computing machines. J. Chem. Phys., 21:1087-1091, 1953.
15. B. Selman, H.A. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996.
16. C.H. Papadimitriou. On selecting a satisfying truth assignment. In Proc. 32nd Annual Symposium on Foundations of Computer Science, pages 163-169, 1991.
17. T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi. Combining component caching and clause learning for effective model counting. In Theory and Applications of Satisfiability Testing (SAT), 2004.
18. N. Een and N. Sorensson. An extensible sat-solver. In Theory and Applications of Satisfiability Testing (SAT), pages 333-336. Springer, 2004.
19. H. Kautz and B. Selman. Planning as satisfiability. In Proc. 10th European Conference on Artificial Intelligence (ECAI), pages 359-363, 1992.
20. H.H. Hoos and T. Stiitzle. SATLlB: An Online Resource for Research on SAT. Sat2000: highlights of satisfiability research in the year 2000, page 283, 2000.
21. M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. Approximation algorithms for NPhard problems, pages 482-520, 1997.
22. W. Wei and B. Selman. A new approach to model counting. In Theory and Applications of Satisfiability Testing (SAT), pages 324-339, 2005.
23. V. Gogate and R. Dechter. Approximate counting by sampling the backtrack-free search space. In Proc. 22nd National Conference on Artifical Intelligence (AAAI), volume 22, page 198, 2007.