A Two-Levels Local Search Algorithm for Random SAT Instances with Long Clauses.
André AbraméDjamal HabetDonia ToumiPublished in: STAIRS (2014)
Keyphrases
- random sat instances
- search algorithm
- max sat
- sat problem
- stochastic local search
- satisfiability problem
- search space
- boolean satisfiability
- random sat
- sat solvers
- heuristic search
- branch and bound
- sat instances
- phase transition
- search tree
- lower bound
- propositional satisfiability
- first order logic
- state space
- dynamic programming
- computational complexity