On the Satisfiability Threshold of Random Community-Structured SAT.
Dina Barak-PellegDaniel BerendPublished in: IJCAI (2018)
Keyphrases
- satisfiability problem
- sat problem
- phase transition
- random sat
- sat solving
- sat instances
- randomly generated
- sat solvers
- satisfiability testing
- np complete
- sat encodings
- propositional satisfiability
- stochastic local search
- random instances
- boolean satisfiability
- davis putnam logemann loveland
- random constraint satisfaction problems
- search algorithm
- max sat
- temporal logic
- random sat instances
- conjunctive normal form
- structured data
- computational complexity
- cnf formula
- stochastic local search algorithms
- boolean formula
- np complete problems
- propositional logic
- davis putnam
- constraint satisfaction problems
- real world
- variable ordering
- learning community