Valued Constraint Satisfaction Problems: Hard and Easy Problems.
Thomas SchiexHélène FargierGérard VerfailliePublished in: IJCAI (1) (1995)
Keyphrases
- constraint satisfaction problems
- np complete
- combinatorial problems
- constraint satisfaction
- soft constraints
- computational problems
- pseudo boolean optimization
- solving constraint satisfaction problems
- constraint propagation
- constraint problems
- partial constraint satisfaction
- constraint solving
- random instances
- finite domain
- constraint programming
- arc consistency
- graph coloring
- search space
- finding optimal solutions
- non binary
- backtracking search
- disjunctive constraints
- optimization problems
- hard problems
- decomposition methods
- temporal constraints
- configuration problems
- tractable classes
- arithmetic constraints
- np hard
- search algorithm
- decision problems