Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems.
Andreas GalanisLeslie Ann GoldbergKuan YangPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- decision diagrams
- search space
- np complete
- arc consistency
- pseudo boolean optimization
- constraint networks
- np hard
- partial constraint satisfaction
- bounded degree
- soft constraints
- non binary
- sat problem
- global constraints
- backtracking search
- graph theoretic
- constraint solving
- symmetry breaking
- boolean functions