Solving conditional and composite constraint satisfaction problems.
Malek MouhoubAmrudee SukpanPublished in: SAC (2007)
Keyphrases
- constraint satisfaction problems
- constraint problems
- constraint satisfaction
- partial constraint satisfaction
- finite domain
- dynamic constraint satisfaction problems
- backtracking algorithm
- constraint propagation
- constraint optimization
- disjunctive temporal
- search space
- finding optimal solutions
- problems in artificial intelligence
- combinatorial problems
- constraint programming
- arc consistency
- graph coloring
- np complete
- non binary
- solving constraint satisfaction problems
- constraint solvers
- configuration problems
- graph coloring problems
- constraint solving
- sat encodings
- pseudo boolean optimization
- set bounds propagation
- global constraints
- sat problem
- np hard
- solving planning problems
- forward checking
- backtracking search
- soft constraints
- constraint networks
- search algorithm
- solving problems
- decomposition methods
- np complete problems
- temporal constraints
- branch and bound
- combinatorial optimization
- state space
- product configuration
- constraint solver
- special case
- lower bound
- reasoning problems