A Dynamic Approach for MPE and Weighted MAX-SAT

The problem of Most Probable Explanation (MPE) arises in the scenario of probabilistic inference: finding an assignment to all variables that has the maximum likelihood given some evidence. We consider the more general CNF-based MPE problem, where each literal in a CNF-formula is associated with a weight. We describe reductions between MPE and weighted MAX-SAT, and show that both can be solved by a variant of weighted model counting. The MPE-SAT algorithm is quite competitive with the state-of-the-art MAX-SAT, WCSP, and MPE solvers on a variety of problems.

[1]  Simon de Givry,et al.  Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.

[2]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[3]  Adnan Darwiche,et al.  New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.

[4]  Andreas G. Veneris.  Fault diagnosis and logic debugging using Boolean satisfiability , 2003, Proceedings. 4th International Workshop on Microprocessor Test and Verification - Common Challenges and Solutions.

[5]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[6]  Adnan Darwiche,et al.  Compiling Bayesian Networks with Local Structure , 2005, IJCAI.

[7]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[8]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[9]  Henry A. Kautz,et al.  Heuristics for Fast Exact Model Counting , 2005, SAT.

[10]  Adnan Darwiche,et al.  A Structure-Based Variable Ordering Heuristic for SAT , 2003, IJCAI.

[11]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[12]  Felip Manyà,et al.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.

[13]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[14]  Adnan Darwiche,et al.  A compiler for deterministic, decomposable negation normal form , 2002, AAAI/IAAI.

[15]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[16]  Igor L. Markov,et al.  PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer , 2000 .

[17]  James D. Park.  Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.

[18]  Felip Manyà,et al.  Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.

[19]  Toniann Pitassi,et al.  Value Elimination: Bayesian Interence via Backtracking Search , 2002, UAI.

[20]  Simon de Givry,et al.  Solving Max-SAT as Weighted CSP , 2003, CP.