Near-uniform sampling of combinatorial spaces using XOR constraints

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 481-488

  Gomes, Carla P ^a   Sabharwal, Ashish ^a   Selman, Bart ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAE; COMBINATORIAL PROBLEM; COMBINATORIAL PROPERTIES; MARKOV CHAIN MONTE CARLO METHOD; PROBABILISTIC REASONING; SAMPLING ALGORITHM; SAMPLING DISTRIBUTION; SAMPLING QUALITY; SAT INSTANCES; SAT PROBLEMS; SAT SOLVERS; XOR CONSTRAINTS;

MONTE CARLO METHODS;

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

References (19)

1. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62(1-2):107-136, 2006.
2. H. Poon and P. Domingos. Sound and efficient inference with probabilistic and deterministic dependencies. In 21th AAAI, pages 458.463, Boston, MA, July 2006.
3. N. Madras. Lectures on Monte Carlo methods. In Field Institute Monographs, vol. 16. Amer. Math. Soc., 2002.
4. 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.
5. S. Kirkpatrick, D. Gelatt Jr., and M. Vecchi. Optimization by simuleated annealing. Science, 220(4598): 671-680, 1983.
6. D. Roth. On the hardness of approximate reasoning. J. AI, 82(1-2):273-302, 1996.
7. M. L. Littman, S. M. Majercik, and T. Pitassi. Stochastic Boolean satisfiability. J. Auto. Reas., 27(3):251-296, 2001.
8. J. D. Park. MAP complexity results and approximation methods. In 18th UAI, pages 388-396, Edmonton, Canada, August 2002.
9. A. Darwiche. The quest for efficient probabilistic inference, July 2005. Invited Talk, IJCAI-05.
10. T. Sang, P. Beame, and H. A. Kautz. Performing Bayesian inference by weighted model counting. In 20th AAAI, pages 475-482, Pittsburgh, PA, July 2005.
11. F. Bacchus, S. Dalmao, and T. Pitassi. Algorithms and complexity results for #SAT and Bayesian inference. In 44nd FOCS, pages 340-351, Cambridge, MA, October 2003.
12. R. J. Bayardo Jr. and R. C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In 14th AAAI, pages 203-208, Providence, RI, July 1997.
13. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In ICCAD, pages 279-285, San Jose, CA, November 2001.
14. N. Eén and N. Sörensson. MiniSat: A SAT solver with conflict-clause minimization. In 8th SAT, St. Andrews, U.K., June 2005. Poster.
15. C. P. Gomes, A. Sabharwal, and B. Selman. Model counting: A new strategy for obtaining good bounds. In 21th AAAI, pages 54-61, Boston, MA, July 2006.
16. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Comput. Sci., 47(3):85-93, 1986.
17. J. M. Crawford, M. J. Kearns, and R. E. Schapire. The minimal disagreement parity problem as a hard satisfiability problem. Technical report, AT&T Bell Labs., 1994.
18. D. Achlioptas, A. Naor, and Y. Peres. Rigorous location of phase transitions in hard optimization problems. Nature, 435:759-764, 2005.
19. W. Wei, J. Erenrich, and B. Selman. Towards efficient sampling: Exploiting random walk strategies. In 19th AAAI, pages 670-676, San Jose, CA, July 2004.