The SAT-UNSAT transition in the adversarial SAT problem.
Marco BardosciaDaniel NagajAntonello ScardicchioPublished in: CoRR (2013)
Keyphrases
- sat solvers
- sat problem
- boolean satisfiability
- sat solving
- propositional satisfiability
- sat instances
- orders of magnitude
- max sat
- search space
- constraint satisfaction
- davis putnam
- solving hard
- search strategies
- np complete problems
- search tree
- satisfiability problem
- clause learning
- boolean formula
- stochastic local search
- random sat instances
- np complete
- heuristic search
- sat encodings
- phase transition
- maximum satisfiability
- genetic algorithm