Diagnosing and Solving Over-Determined Constraint Satisfaction Problems.
R. R. BakkerF. DikkerF. TempelmanP. M. WognumPublished in: IJCAI (1993)
Keyphrases
- constraint satisfaction problems
- constraint problems
- finite domain
- partial constraint satisfaction
- constraint satisfaction
- dynamic constraint satisfaction problems
- constraint optimization
- constraint propagation
- backtracking algorithm
- constraint programming
- disjunctive temporal
- np complete
- constraint solvers
- graph coloring
- non binary
- graph coloring problems
- problems in artificial intelligence
- np hard
- combinatorial problems
- finding optimal solutions
- search space
- configuration problems
- solving constraint satisfaction problems
- arc consistency
- constraint networks
- set bounds propagation
- constraint solving
- product configuration
- computational problems
- soft constraints
- constraint solver
- solving planning problems
- decomposition methods
- pseudo boolean optimization
- scheduling problem
- global constraints
- sat problem
- backtracking search
- np complete problems
- search algorithm
- difficult problems
- disjunctive constraints
- timetabling problem
- solving problems
- path consistency
- sat encodings
- temporal reasoning
- combinatorial optimization