No-Rainbow Problem and the Surjective Constraint Satisfaction Problem.
Dmitriy ZhukPublished in: LICS (2021)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np hard
- np complete
- search space
- sat problem
- arc consistency
- constraint solving
- non binary
- global constraints
- constraint networks
- tractable subclasses
- product configuration
- forward checking
- search algorithm
- partial constraint satisfaction
- finite domain
- dynamic constraint satisfaction problems
- special case
- tree decompositions
- constraint solver
- constraint problems
- hard constraints
- decomposition methods