Typical random 3-SAT formulae and the satisfiability threshold.
Olivier DuboisYacine BoufkhadJacques MandlerPublished in: SODA (2000)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- max sat
- random sat instances
- random constraint satisfaction problems
- sat instances
- np complete
- stochastic local search
- boolean satisfiability
- sat solvers
- randomly generated
- davis putnam
- graph coloring
- constraint satisfaction problems
- constraint satisfaction
- temporal logic
- learning algorithm
- knowledge base
- search algorithm
- cnf formula
- lower bound
- search space
- description logics
- logic programs
- branch and bound algorithm
- orders of magnitude