A Dichotomy Theorem for Typed Constraint Satisfaction Problems.
Su ChenTomasz ImielinskiKarin JohnsgardDonald SmithMario SzegedyPublished in: SAT (2006)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- combinatorial problems
- arc consistency
- search space
- constraint solving
- np hard
- non binary
- pseudo boolean optimization
- constraint networks
- solving constraint satisfaction problems
- arithmetic constraints
- partial constraint satisfaction
- decomposition methods
- global constraints
- forward checking
- constraint optimization
- backtracking search
- finding optimal solutions
- disjunctive temporal
- sat problem
- soft constraints
- computational problems
- constraint problems
- temporal constraints