Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems.
Uwe SchöningPublished in: CSR (2010)
Keyphrases
- constraint satisfaction problems
- stochastic local search algorithms
- constraint satisfaction
- satisfiability problem
- np complete
- constraint propagation
- search space
- constraint programming
- search algorithm
- np hard
- arc consistency
- constraint problems
- global constraints
- combinatorial problems
- constraint solving
- soft constraints
- non binary
- sat problem
- constraint networks
- decomposition methods
- product configuration
- phase transition
- forward checking
- disjunctive temporal
- constraint optimization
- special case
- solving constraint satisfaction problems
- finding optimal solutions
- partial constraint satisfaction
- temporal reasoning
- random instances
- backtracking algorithm
- backtracking search