Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions.
Laura ClimentMiguel A. SalidoFederico BarberPublished in: SARA (2011)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- arc consistency
- non binary
- search space
- np hard
- partial constraint satisfaction
- combinatorial problems
- constraint solving
- dynamic constraint satisfaction problems
- global constraints
- forward checking
- product configuration
- constraint problems
- distributed constraint satisfaction problems
- solving constraint satisfaction problems
- pseudo boolean optimization
- graph coloring
- reasoning problems
- finite domain
- constraint networks
- soft constraints
- constraint optimization
- disjunctive temporal
- backtracking algorithm
- weighted constraint satisfaction
- heuristic search
- search strategies
- constraint solvers
- lower bound
- path consistency