On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT.
Dave A. D. TompkinsHolger H. HoosPublished in: Canadian Conference on AI (2006)
Keyphrases
- stochastic local search
- satisfiability problem
- randomly generated
- random sat instances
- phase transition
- sat problem
- max sat
- solving hard
- combinatorial optimisation
- sat instances
- decision making
- propositional satisfiability
- decision makers
- random sat
- sat solvers
- search space
- tree search
- data structure
- scheduling problem
- constraint satisfaction problems
- query expansion