Robustness, stability, recoverability, and reliability in constraint satisfaction problems.
Federico BarberMiguel A. SalidoPublished in: Knowl. Inf. Syst. (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint programming
- constraint propagation
- combinatorial problems
- arc consistency
- non binary
- np complete
- computational problems
- weighted constraint satisfaction
- tractable subclasses
- constraint networks
- np hard
- constraint solving
- constraint problems
- decomposition methods
- finding optimal solutions
- arithmetic constraints
- arc consistency algorithm
- constraint optimization
- finite domain
- soft constraints
- forward checking
- constraint graph
- reasoning problems
- product configuration
- optimal solution
- partial constraint satisfaction
- temporal constraints
- phase transition
- pseudo boolean optimization