Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems.
Andreas GalanisLeslie Ann GoldbergKuan YangPublished in: ICALP (2017)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- decision diagrams
- constraint propagation
- np complete
- constraint programming
- search space
- non binary
- arc consistency
- constraint solving
- boolean functions
- partial constraint satisfaction
- backtracking search
- solving constraint satisfaction problems
- soft constraints
- multi valued
- pseudo boolean optimization
- bounded degree
- graph theoretic
- np hard
- constraint problems
- global constraints
- computational complexity
- constraint networks
- dynamic programming
- xml documents