On the Consistency of General Constraint-Satisfaction Problems.
Philippe JégouPublished in: AAAI (1993)
Keyphrases
- constraint satisfaction problems
- tractable subclasses
- constraint satisfaction
- constraint networks
- constraint programming
- constraint propagation
- constraint problems
- path consistency
- np complete
- search space
- special case
- pseudo boolean optimization
- global constraints
- non binary
- graph coloring problems
- tractable classes
- np hard
- weighted constraint satisfaction
- computational problems
- arc consistency
- disjunctive constraints
- combinatorial problems
- consistency checking
- sat problem
- decomposition methods
- soft constraints
- finite domain
- constraint optimization
- binary constraints
- maintaining arc consistency
- lower bound
- constraint graph
- constraint solving
- finding optimal solutions
- solving constraint satisfaction problems
- forward checking