Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Using expectation maximization to find likely assignments for solving CSP's
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper introduces a notational frame to characterize the four basic product-based Message Passing (MP) heuristics currently available for SAT: Belief Propagation (BP), Survey Propagation (SP), Expectation Maximization BP Global (EMBPG) and Expectation Maximization SP Global (EMSPG). Using this framework, the paper introduces indirect structural interpolation (ISI). Using this technique, we create a hierarchy of heuristics --- each new level in this hierarchy consists of heuristics strictly more general than their predecessors. The final result is the ρσPMPi heuristic, which is able to mimic all product-based MP heuristics and is hence a generalization for all them.