Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems.
Lucas BordeauxMarco CadoliToni ManciniPublished in: LPAR (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- search space
- binary constraints
- constraint solving
- combinatorial problems
- arc consistency
- np hard
- product configuration
- non binary
- computational problems
- constraint networks
- constraint problems
- finite domain
- tractable subclasses
- temporal constraints
- hard constraints
- global constraints
- soft constraints
- sat problem
- decomposition methods
- forward checking
- constraint solvers
- pseudo boolean optimization
- symmetry breaking
- constraint solver
- random instances
- constraint optimization
- backtracking search
- arithmetic constraints
- maintaining arc consistency
- dynamic constraint satisfaction problems