Strong Refutation Heuristics for Random k-SAT.
Amin Coja-OghlanAndreas GoerdtAndré LankaPublished in: Comb. Probab. Comput. (2007)
Keyphrases
- random instances
- stochastic local search algorithms
- phase transition
- search algorithm
- search strategies
- propositional satisfiability
- variable ordering
- satisfiability problem
- sat solvers
- truth assignment
- search procedures
- sat problem
- randomly generated
- theorem proving
- sat instances
- stochastic local search
- solving hard
- theorem prover
- max sat
- optimal solution
- search space
- sat solving
- np complete
- heuristic search
- np complete problems
- boolean satisfiability
- randomly chosen
- branch and bound
- classical logic