Partial Polymorphisms and Constraint Satisfaction Problems.
Henning SchnoorIlka SchnoorPublished in: Complexity of Constraints (2008)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- partial assignment
- combinatorial problems
- constraint solving
- maintaining arc consistency
- arc consistency
- search space
- np hard
- global constraints
- non binary
- sat problem
- product configuration
- solving constraint satisfaction problems
- forward checking
- decomposition methods
- partial constraint satisfaction
- special case
- constraint problems
- disjunctive temporal
- pseudo boolean optimization
- finding optimal solutions
- arithmetic constraints
- disjunctive constraints
- soft constraints
- constraint networks
- temporal constraints