Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings.
Laura ClimentRichard J. WallaceMiguel A. SalidoFederico BarberPublished in: Artif. Intell. Rev. (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint optimization
- constraint propagation
- constraint programming
- graph coloring problems
- non binary
- np complete
- ordered binary decision diagrams
- arc consistency
- search space
- constraint networks
- np hard
- constraint solving
- computational problems
- decomposition methods
- configuration problems
- search problems
- combinatorial problems
- product configuration
- finite domain
- soft constraints
- sat problem
- finding optimal solutions
- symmetry breaking
- constraint graph
- backtracking search