From sampling to model counting

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2293-2299

  Gomes, Carla P ^a   Hoffmann, Joerg ^b   Sabharwal, Ashish ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY PROBLEMS; COUNTING MODELS; FORMAL ANALYSIS; LOCAL SEARCH; MODEL COUNTING; SOLUTION SPACE;

ARTIFICIAL INTELLIGENCE;

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

References (18)

1. R. J. Bayardo Jr. and J. D. Pehoushek. Counting models using connected components. In 17th AAAI, pg. 157-162, Austin, TX, Jul 2000.
2. A. Darwiche. The quest for efficient probabilistic inference, Jul 2005. Invited Talk, IJCAI-05.
3. N. Eén and N. Sörensson. MiniSat: A SAT solver with conflict-clause minimization. In 8th SAT, St. Andrews, U.K., Jun 2005. Poster.
4. C. P. Gomes, A. Sabharwal, and B. Selman. Model counting: A new strategy for obtaining good bounds. In 21th AAAI, pg. 54-61, Boston, MA, Jul 2006.
5. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Comput. Sci., 43:169-188, 1986.
6. P. Kilby, J. Slaney, S. Thiébaux, and T. Walsh. Estimating search tree size. In 21th AAAI, pg. 1014-1019, Boston, MA, Jul 2006.
7. S. Kirkpatrick, D. Gelatt Jr., and M. Vecchi. Optimization by simuleated annealing. Science, 220(4598):671-680, 1983.
8. M. L. Littman, S.M.Majercik, and T. Pitassi. Stochastic Boolean satisfiability. J. Auto. Reas., 27(3):251-296, 2001. (Pubitemid 32933529)
9. N. Madras. Lectures on Monte Carlo methods. In Field Institute Monographs, volume 16. Amer. Math. Soc., 2002.
10. D. A. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In AAAI/IAAI, pg. 321-326, Providence, RI, Jul 1997.
11. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of state calculations by fast computing machines. J. Chem. Phy., 21:1087-1092, 1953.
12. J. D. Park. MAP complexity results and approximation methods. In 18th UAI, pg. 388-396, Edmonton, Canada, Aug 2002.
13. D. Roth. On the hardness of approximate reasoning. J. AI, 82(1-2):273-302, 1996.
14. T. Sang, F. Bacchus, P. Beame, H. A. Kautz, and T. Pitassi. Combining component caching and clause learning for effective model counting. In 7th SAT, Vancouver, B.C., Canada, May 2004. Online Proceedings.
15. T. Sang, P. Beame, and H. A. Kautz. Performing Bayesian inference by weighted model counting. In 20th AAAI, pg. 475-482, Pittsburgh, PA, Jul 2005.
16. S. Toda. On the computational power of PP and ⊕P. In 30th FOCS, pg. 514-519, 1989.
17. W.Wei and B. Selman. A new approach to model counting. In 8th SAT, volume 3569 of LNCS, pg. 324-339, St. Andrews, U.K., Jun 2005.
18. W. Wei, J. Erenrich, and B. Selman. Towards efficient sampling: Exploiting random walk strategies. In 19th AAAI, pg. 670-676, San Jose, CA, Jul 2004.