Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT.
Tobias FriedrichRalf RothenbergerPublished in: SAT (2018)
Keyphrases
- satisfiability problem
- sat problem
- phase transition
- random sat
- sat solving
- satisfiability testing
- randomly generated
- np complete
- stochastic local search
- random sat instances
- sat encodings
- sat instances
- propositional satisfiability
- sat solvers
- search algorithm
- random constraint satisfaction problems
- temporal logic
- random instances
- stochastic local search algorithms
- davis putnam logemann loveland
- boolean satisfiability
- constraint satisfaction
- davis putnam
- propositional logic
- boolean formula
- propositional formulas
- constraint satisfaction problems
- first order logic
- knowledge base
- computational complexity
- backtracking search
- conjunctive normal form
- quality assessment