Using Finite Domains in Constraint Satisfaction Problem.
Ilié PopescuPublished in: Intelligent Information Processing (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- search space
- constraint programming
- constraint optimization
- np complete
- graph coloring problems
- constraint solving
- partial constraint satisfaction
- configuration problems
- non binary
- arc consistency
- constraint networks
- global constraints
- forward checking
- search problems
- product configuration
- special case
- pseudo boolean optimization
- reasoning problems
- computational complexity
- temporal constraints
- temporal reasoning
- np hard