How to take into account piecewise constraints in constraint satisfaction problems.
Élise VareillesMichel AldanondoPaul GaboritPublished in: Eng. Appl. Artif. Intell. (2009)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint solving
- non binary
- solving constraint satisfaction problems
- global constraints
- combinatorial problems
- constraint solver
- soft constraints
- constraint networks
- disjunctive temporal
- constraint propagation
- finite domain
- arc consistency algorithm
- arc consistency
- constraint problems
- np complete
- dynamic constraint satisfaction problems
- constraint graph
- binary constraints
- search space
- decomposition methods
- hard constraints
- constraint optimization
- np hard
- disjunctive constraints
- configuration problems
- constraint solvers
- weighted constraint satisfaction
- arithmetic constraints
- path consistency
- symmetry breaking
- tractable classes
- computational problems
- product configuration
- sat problem
- forward checking
- maintaining arc consistency
- backtracking algorithm
- temporal constraints
- temporal reasoning
- partial assignment
- lower bound