-SAT Instances with Almost Minimal Occurrences of Each Variable.
William MatthewsRamamohan PaturiPublished in: SAT (2010)
Keyphrases
- sat instances
- sat solvers
- satisfiability problem
- sat problem
- boolean formula
- randomly generated
- random sat instances
- phase transition
- computational properties
- pattern matching
- stochastic local search
- propositional satisfiability
- boolean satisfiability
- search tree
- description logics
- search algorithm
- frequent episodes
- boolean functions
- search strategies
- database