Lukas Kroc
Bart Selman
ABSTRACT
Decimation is a simple process for solving constraint satisfaction problems, by repeatedly fixing variable values and simplifying without reconsidering earlier decisions. We investigate different decimation strategies, contrasting those based on local, syntactic information from those based on message passing, such as statistical physics based Survey Propagation (SP) and the related and more well-known Belief Propagation (BP). Our results reveal that once we resolve convergence issues, BP itself can solve fairly hard random k-SAT formulas through decimation; the gap between BP and SP narrows down quickly as k increases. We also investigate observable differences between BP/SP and other common CSP heuristics as decimation proceeds, exploring the hardness of the decimated formulas and identifying a somewhat unexpected feature of message passing heuristics, namely, unlike other heuristics for satisfiability, they avoid unit propagation as variables are fixed.
- D. Achlioptas, A. Naor, and Y. Peres. Rigorous location of phase transitions in hard optimization problems. Nature, 435: 759--764, 2005.Google Scholar
Cross Ref
- A. Braunstein and R. Zecchina. Survey propagation as local equilibrium equations. J. Stat. Mech., P06007, 2004. URL http://lanl.arXiv.org/cond-mat/0312483.Google ScholarCross Ref
- M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM, 5: 394--397, 1962. Google ScholarDigital Library
- M. Davis and H. Putnam. A computing procedure for quantification theory. CACM, 7: 201--215, 1960. Google ScholarDigital Library
- N. Eén and N. Sörensson. MiniSat: A SAT solver with conflictclause minimization. In 8th SAT, St. Andrews, U.K., June 2005.Google Scholar
- M. 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- L. Kroc, A. Sabharwal, and B. Selman. Survey propagation revisited. In 23rd UAI, pages 217--226, Vancouver, BC, July 2007.Google Scholar
- L. 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Mézard, G. Parisi, and R. Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297(5582): 812--815, 2002.Google ScholarCross Ref
- 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.Google Scholar
- M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 38th DAC, pages 530--535, Las Vegas, NV, June 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988. Google ScholarDigital Library
- M. Pretti. A message-passing algorithm with damping. J. Stat. Mech., P11008, 2005.Google ScholarCross Ref
- 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.Google Scholar
- J. S. Yedidia, W. T. Freeman, and Y. Weiss. Generalized belief propagation. In NIPS, pages 689--695, 2000.Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Message-passing and local heuristics as decimation strategies for satisfiability
Recommendations
Perturbed message passing for constraint satisfaction problems
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single ...
Automated discovery of local search heuristics for satisfiability testing
The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search ...
Planning as satisfiability: Heuristics
Reduction to SAT is a very successful approach to solving hard combinatorial problems in Artificial Intelligence and computer science in general. Most commonly, problem instances reduced to SAT are solved with a general-purpose SAT solver. Although ...
Comments