Abstract
Message Passing (MP) has been presented in a unified and consistent notational frame in [7]. The paper explained the product-based MP framework (PMPF) and various MP heuristics (BP, SP, and several interpolations). The paper concluded, that an increased flexibility of MP heuristics (in the form of tunable parameters) leads to a tunable MP algorithm that can be helpful to solve a wide variety of different CNFs.
Based on this work, the paper at hand makes three contributions. First, we extend the PMPF regarding flexibility based on theoretical insights from the Ising Model [13]. As an immediate result, this extended PMPF (ePMPF) provides new possibilities for parameter tuning. Second, the ePMPF will also allow us to uncover various theoretical connections between well-known variable and value ordering heuristics for SAT (Zero-first, One-first, occurrence-based heuristics). We show, that these heuristics can be understood as special cases of Message Passing. Third, we show that the ePMPF provides numerous possibilities to tightly integrate Message Passing with various aspects of the CDCL search paradigm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Battaglia, D., Kolář, M., Zecchina, R.: Minimizing energy below the glass thresholds. Physical Review E 70, 036107 (2004)
Braunstein, A., Mézard, M., Zecchina, R.: Survey Propagation: An Algorithm for Satisfiability. Journal of Rand. Struct. and Algo., 201 (2005)
Cipra, B.A.: An Introduction to the Ising Model. The American Mathematical Monthly 94(10), 937 (1987)
Cook, S.: The complexity of theorem-proving procedures. In: Symposium on the Theory of Computing (STOC 1971), p. 151. ACM, New York (1971)
Dempster, A., Laird, N., Rubin, D.: Maximum Likelihood from Incomplete Data via the EM Algorithm. Jrn. o. t. Royal Statistical Society, Series B 39, 1 (1977)
Eén, N., Sörensson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Gableske, O.: On the Interpolation between Product-Based Message Passing Heuristics for SAT. In: Järvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 293–308. Springer, Heidelberg (2013)
Gableske, O., Müelich, S., Diepold, D.: On the Performance of CDCL based Message Passing Inspired Decimation using ρσPMPi. In: Pragmatics of SAT, POS 2013 (2013)
Hsu, E.I., McIlraith, S.A.: VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 377–390. Springer, Heidelberg (2009)
Hsu, E.I., McIlraith, S.A.: Characterizing Propagation Methods for Boolean Satisfiability. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 325–338. Springer, Heidelberg (2006)
Hsu, E.I., Muise, C.J., Beck, J.C., McIlraith, S.A.: Probabilistically Estimating Backbones and Variable Bias: Experimental Overview. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 613–617. Springer, Heidelberg (2008)
Hsu, E., Kitching, M., Bacchus, F., McIlraith, S.: Using Expectation Maximization to Find Likely Assignments for Solving CSPs. In: Conference on Artificial Intelligence (AAAI 2007), p. 224. AAAI Press (2007)
Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Zeitschrift für Physik, Nummer 31, 253 (1925)
Schischang, K., Frey, B., Loeliger, H.: Factor Graphs and the sum-product algorithm. In: IEEE Transactions on Information Theory (IT 2001), vol. 47, p. 498. IEEE (2002)
Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers (C 1999) 48, 506 (1999)
Mézard, M., Parisi, G.: The cavity method at zero temperature. Journal of Statistical Physics 111(1/2) (April 2003)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conf. (DAC 2001), p. 530. ACM (2001)
Stein, D., Newman, C.: Spin Glasses and Complexity. Princeton Press (2013) ISBN 978-0-691-14733-8
Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: International Conference on Computer Aided Design (ICCAD 2001), p. 279 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gableske, O. (2014). An Ising Model Inspired Extension of the Product-Based MP Framework for SAT. In: Sinz, C., Egly, U. (eds) Theory and Applications of Satisfiability Testing – SAT 2014. SAT 2014. Lecture Notes in Computer Science, vol 8561. Springer, Cham. https://doi.org/10.1007/978-3-319-09284-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-09284-3_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09283-6
Online ISBN: 978-3-319-09284-3
eBook Packages: Computer ScienceComputer Science (R0)