There is a strong connection between SAT, spin models and inference in graphical probabilistic models. All can be seen as instances of markov random fields. Th

There is a strong connection between SAT, spin models and inference in graphical probabilistic models. All can be seen as instances of markov random fields. They can all be solved with the same algorithms that are very fast for most practical problems. - With backtracking: https://www.jair.org/media/2648/live-2648-4340-jair.pdf https://www.jair.org/media/2648/live-2648-4340-jair.pdf - With belief propagation: http://web.stanford.edu/~montanar/TEACHING/Stat319/papers/yedidia.pdf http://web.stanford.edu/~montanar/TEACHING/Stat319/papers/ye...