Lifted Message Passing for Satisfiability

Unifying logical and probabilistic reasoning is a long-standing goal of AI. While recent work in lifted belief propagation, handling whole sets of indistinguishable objects together, are promising steps towards achieving this goal that even scale to realistic domains, they are not tailored towards solving combinatorial problems such as determining the satisfiability of Boolean formulas. Recent results, however, show that certain other message passing algorithms, namely, survey propagation, are remarkably successful at solving such problems. In this paper, we propose the first lifted variants of survey propagation and its simpler version warning propagation. Our initial experimental results indicate that they are faster than using lifted belief propagation to determine the satisfiability of Boolean formulas.

[1]  Riccardo Zecchina,et al.  Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.

[2]  Daniel Tarlow,et al.  Using Combinatorial Optimization within Max-Product Belief Propagation , 2006, NIPS.

[3]  Pedro M. Domingos,et al.  Sound and Efficient Inference with Probabilistic and Deterministic Dependencies , 2006, AAAI.

[4]  Riccardo Zecchina,et al.  Survey propagation as local equilibrium equations , 2003, ArXiv.

[5]  Pedro M. Domingos,et al.  Memory-Efficient Inference in Relational Domains , 2006, AAAI.

[6]  Pedro M. Domingos,et al.  Lifted First-Order Belief Propagation , 2008, AAAI.

[7]  Andrea Montanari,et al.  Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation , 2007, ArXiv.

[8]  Leslie Pack Kaelbling,et al.  Lifted Probabilistic Inference with Counting Formulas , 2008, AAAI.

[9]  Bart Selman,et al.  Message-passing and local heuristics as decimation strategies for satisfiability , 2009, SAC '09.

[10]  Bart Selman,et al.  Survey Propagation Revisited , 2007, UAI.

[11]  Kristian Kersting,et al.  Counting Belief Propagation , 2009, UAI.

[12]  Kristian Kersting,et al.  Lifted Probabilistic Inference , 2012, ECAI.

[13]  Pedro M. Domingos,et al.  A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC , 2008, AAAI.

[14]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[15]  Joris M. Mooij,et al.  libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models , 2010, J. Mach. Learn. Res..

[16]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[17]  Lise Getoor,et al.  Exploiting shared correlations in probabilistic databases , 2008, Proc. VLDB Endow..