Strategies for Solving SAT in Grids by Randomized Search.
Antti Eero Johannes HyvärinenTommi A. JunttilaIlkka NiemeläPublished in: AISC/MKM/Calculemus (2008)
Keyphrases
- randomized search
- sat solving
- search strategies
- np complete problems
- stochastic local search
- sat instances
- sat encodings
- sat solvers
- search algorithm
- weighted max sat
- satisfiability problem
- sat problem
- boolean satisfiability
- phase transition
- online auctions
- graph coloring
- max sat
- variable ordering
- neural network
- simulated annealing
- cost function
- genetic algorithm