Message-passing and local heuristics as decimation strategies for satisfiability

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1408-1414

  Kroc, Lukas ^a   Sabharwal, Ashish ^a   Selman, Bart ^a  

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

Author keywords

Belief propagation; Constraint reasoning; Heuristics; SAT; Survey propagation

Indexed keywords

BELIEF PROPAGATION; CONSTRAINT REASONING; CONSTRAINT SATISFACTION PROBLEMS; RANDOM K-SAT FORMULAS; SATISFIABILITY; STATISTICAL PHYSICS; SURVEY PROPAGATION; SYNTACTIC INFORMATION; UNIT PROPAGATION;

COMPUTER SCIENCE; HEURISTIC METHODS; MESSAGE PASSING; SURVEYS;

BACKPROPAGATION;

EID: 72949096308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529596     Document Type: Conference Paper

References (21)

1. Achlioptas, A. Naor, and Y. Peres. Rigorous location of phase transitions in hard optimization problems. Nature, 435:759-764, 2005.
2. A. Braunstein and R. Zecchina. Survey propagation as local equilibrium equations. J. Stat. Mech., P06007, 2004. URL http://lanl.arXiv.org/cond- mat/0312483.
3. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM, 5:394-397, 1962.
4. Davis and H. Putnam. A computing procedure for quantification theory. CACM, 7:201-215, 1960.
5. N. Eén and N. Sörensson. MiniSat: A SAT solver with conict-clause minimization. In 8th SAT, St. Andrews, U.K., June 2005.
6. Hajiaghayi and G. B. Sorkin. The satisability threshold of random 3-SAT is at least 3.52. Technical Report RC22942, IBM Research Report, 2003. http://arxiv.org/pdf/math.CO/0310193.
7. E. I. Hsu and S. A. McIlraith. Characterizing propagation methods for boolean satisfiabilty. In 9th SAT, volume 4121 of LNCS, pages 325-338, Seattle, WA, Aug. 2006.
8. A. C. Kaporis, L. M. Kirousis, and E. G. Lalas. The probabilistic analysis of a greedy satisfiability algorithm. Random Structures and Algorithms, 28(4):444-480, 2006.
9. Kroc, A. Sabharwal, and B. Selman. Survey propagation revisited. In 23rd UAI, pages 217-226, Vancouver, BC, July 2007.
10. Kroc, A. Sabharwal, and B. Selman. Leveraging belief propagation, backtrack search, and statistics for model counting. In 5th CPAIOR, volume 5015 of LNCS, pages 127-141, Paris, France, May 2008.
11. E. Maneva, E. Mossel, and M. J. Wainwright. A new look at survey propagation and its generalizations. J. Assoc. Comput. Mach., 54(4):17, July 2007.
12. S. Mertens, M. Mézard, and R. Zecchina. Threshold values of random K-SAT from the cavity method. Random Struct. and Alg., 28(3):340-373, 2006.
13. Mézard, G. Parisi, and R. Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297(5582): 812-815, 2002.
14. J. M. Mooij, B. Wemmenhove, H. J. Kappen, and T. Rizzo. Loop corrected belief propagation. In Proc. 11th Intl. Conf. on AI and Statistics (AISTATS-07), 2007.
15. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an e cient SAT solver. In 38th DAC, pages 530-535, Las Vegas, NV, June 2001.
16. K. Murphy, Y. Weiss, and M. Jordan. Loopy belief propagation for approximate inference: An empirical study. In 15th UAI, pages 467-475, Sweden, July 1999.
17. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
18. Pretti. A message-passing algorithm with damping. J. Stat. Mech., P11008, 2005.
19. B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: the Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in DMTCS, pages 521-532. Amer. Math. Soc., 1996.
20. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Generalized belief propagation. In NIPS, pages 689-695, 2000.
21. A. L. Yuille. CCCP algorithms to minimize the Bethe and Kikuchi free energies: Convergent alternatives to belief propagation. Neural Comput., 14(7):1691-1722, 2002.