Improving Configuration Checking for Satisfiable Random k-SAT Instances.
André AbraméDjamal HabetDonia ToumiPublished in: ISAIM (2014)
Keyphrases
- sat instances
- randomly generated
- random instances
- satisfiability problem
- easy hard easy pattern
- sat problem
- sat solvers
- phase transition
- random sat
- computational properties
- random sat instances
- np complete
- stochastic local search
- boolean satisfiability
- constraint satisfaction problems
- propositional satisfiability
- temporal logic
- branch and bound algorithm
- max sat
- lower bound
- constraint satisfaction