Some Practicable Filtering Techniques for the Constraint Satisfaction Problem.
Romuald DebruyneChristian BessièrePublished in: IJCAI (1) (1997)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- search space
- np hard
- constraint solving
- non binary
- partial constraint satisfaction
- sat problem
- decomposition methods
- constraint networks
- tractable subclasses
- global constraints
- arc consistency
- hard constraints
- finite domain
- soft constraints
- product configuration
- constraint problems
- temporal constraints
- reasoning problems
- tractable classes
- finding optimal solutions