Solving Mixed and Conditional Constraint Satisfaction Problems.
Esther M. GelleBoi FaltingsPublished in: Constraints An Int. J. (2003)
Keyphrases
- constraint satisfaction problems
- constraint problems
- constraint satisfaction
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- finite domain
- constraint optimization
- backtracking algorithm
- constraint programming
- disjunctive temporal
- finding optimal solutions
- constraint propagation
- solving constraint satisfaction problems
- np complete
- problems in artificial intelligence
- constraint solvers
- non binary
- graph coloring
- configuration problems
- solving planning problems
- combinatorial problems
- graph coloring problems
- set bounds propagation
- computational problems
- product configuration
- global constraints
- search space
- forward checking
- constraint networks
- arc consistency
- np hard
- backtracking search
- np complete problems
- soft constraints
- sat encodings
- decomposition methods
- sat problem
- planning problems
- constraint graph
- constraint solver
- reasoning problems
- path consistency