Improving WalkSAT for Random k-Satisfiability Problem with k > 3.
Shaowei CaiKaile SuChuan LuoPublished in: AAAI (2013)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- random sat
- stochastic local search
- phase transition
- sat problem
- solving hard
- stochastic local search algorithms
- davis putnam
- randomly generated
- max sat
- decision procedures
- pspace complete
- mazurkiewicz traces
- sat instances
- conjunctive normal form
- model checking
- cellular automata
- constraint satisfaction problems