Characterizing Propagation Methods for Boolean Satisfiability

@inproceedings{Hsu2006CharacterizingPM,
  title={Characterizing Propagation Methods for Boolean Satisfiability},
  author={Eric I. Hsu and Sheila A. McIlraith},
  booktitle={SAT},
  year={2006}
}
Iterative algorithms such as Belief Propagation and Survey Propagation can handle some of the largest randomly-generated satisfiability problems (SAT) created to this point. But they can make inaccurate estimates or fail to converge on instances whose underlying constraint graphs contain small loops–a particularly strong concern with structured problems. More generally, their behavior is only wellunderstood in terms of statistical physics on a specific underlying model. Our alternative… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS