Towards a dichotomy theorem for the counting constraint satisfaction problem.
Andrei A. BulatovVíctor DalmauPublished in: Inf. Comput. (2007)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- arc consistency
- constraint programming
- search space
- np complete
- np hard
- constraint solving
- non binary
- global constraints
- partial constraint satisfaction
- constraint networks
- decomposition methods
- product configuration
- finite domain
- hard constraints
- disjunctive temporal
- soft constraints
- constraint problems
- constraint graph
- pseudo boolean optimization
- tractable subclasses
- lower bound
- tree decompositions
- backtracking algorithm
- symmetry breaking
- max sat
- sat problem
- randomly generated