Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT.
Tobias FriedrichRalf RothenbergerPublished in: IJCAI (2019)
Keyphrases
- satisfiability problem
- sat problem
- phase transition
- random sat
- satisfiability testing
- sat solving
- randomly generated
- random instances
- sat instances
- sat solvers
- stochastic local search
- np complete
- search algorithm
- sat encodings
- boolean satisfiability
- propositional satisfiability
- temporal logic
- stochastic local search algorithms
- propositional logic
- davis putnam logemann loveland
- random sat instances
- random constraint satisfaction problems
- boolean formula
- constraint satisfaction problems
- davis putnam
- constraint satisfaction
- search strategies
- unit propagation
- max sat
- cnf formula
- decision procedures
- orders of magnitude
- first order logic
- computational properties
- constraint programming