Strong Refutation Heuristics for Random k-SAT.
Amin Coja-OghlanAndreas GoerdtAndré LankaPublished in: APPROX-RANDOM (2004)
Keyphrases
- stochastic local search algorithms
- search algorithm
- search strategies
- propositional satisfiability
- theorem proving
- stochastic local search
- truth assignment
- satisfiability problem
- sat problem
- variable ordering
- search procedures
- randomly generated
- solving hard
- heuristic search
- propositional logic
- theorem prover
- sat solvers
- search problems
- randomly chosen
- sat solving
- tree search
- sat encodings
- boolean satisfiability
- classical logic
- inductive inference
- lower bound