Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT.
Alberto GriggioQuoc-Sang PhanRoberto SebastianiSilvia TomasiPublished in: FroCoS (2011)
Keyphrases
- stochastic local search
- solving hard
- computationally hard problems
- sat instances
- satisfiability problem
- modulo theories
- combinatorial optimisation
- phase transition
- randomly generated
- max sat
- sat solvers
- sat problem
- satisfiability modulo theories
- tree search
- np complete
- random sat instances
- search algorithm
- objective function
- propositional satisfiability
- monte carlo
- np hard