Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems.
Harry B. Hunt IIIMadhav V. MaratheRichard Edwin StearnsPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- search space
- arc consistency
- combinatorial problems
- constraint networks
- solving constraint satisfaction problems
- space complexity
- decomposition methods
- constraint problems
- global constraints
- product configuration
- sat problem
- disjunctive temporal
- forward checking
- np hard
- constraint solving
- computational problems
- non binary
- approximation algorithms
- partial constraint satisfaction
- soft constraints
- temporal constraints
- worst case
- pseudo boolean optimization
- symmetry breaking
- reasoning problems
- constraint solver
- arc consistency algorithm
- decision problems
- finding optimal solutions
- dynamic constraint satisfaction problems