: A Bottom-Up Approach for Solving Quantified CSPs.
Guillaume VergerChristian BessierePublished in: CP (2006)
Keyphrases
- constraint problems
- constraint satisfaction problems
- backtracking algorithm
- partial constraint satisfaction
- constraint satisfaction
- real time
- solving problems
- distributed constraint satisfaction
- configuration problems
- symmetry breaking
- combinatorial optimization
- data driven
- temporal constraints
- sat encodings
- bayesian networks
- genetic algorithm
- universally quantified
- solving constraint satisfaction problems
- neural network