On the Parallel Complexity of Some Constraint Satisfaction Problems.
Simon KasifPublished in: AAAI (1986)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- constraint programming
- constraint propagation
- search space
- combinatorial problems
- constraint solving
- computational complexity
- np hard
- non binary
- constraint problems
- arc consistency
- sat problem
- solving constraint satisfaction problems
- constraint networks
- product configuration
- soft constraints
- finding optimal solutions
- constraint optimization
- forward checking
- global constraints
- space complexity
- constraint solver
- backtracking search
- disjunctive constraints
- partial constraint satisfaction
- maintaining arc consistency
- set bounds propagation
- pseudo boolean optimization