Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems.
Andreas GalanisLeslie Ann GoldbergKuan YangPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- decision diagrams
- constraint programming
- np complete
- non binary
- search space
- constraint solving
- np hard
- arc consistency
- bounded degree
- constraint networks
- graph theoretic
- forward checking
- multi valued
- solving constraint satisfaction problems
- finding optimal solutions
- bounded treewidth
- global constraints
- constraint problems
- social networks
- partial constraint satisfaction
- backtracking search
- sat problem
- special case
- data model
- optimal solution