Using Stochastic Local Search to Solve Quantified Boolean Formulae.
Ian P. GentHolger H. HoosAndrew G. D. RowleyKevin SmythPublished in: CP (2003)
Keyphrases
- stochastic local search
- quantified boolean formulae
- propositional satisfiability
- propositional logic
- satisfiability problem
- phase transition
- davis putnam
- randomly generated
- mathematical programming
- sat problem
- dynamic programming
- constraint satisfaction problems
- belief revision
- temporal logic
- sat instances
- symmetry breaking