Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs.
Gábor KusperTamás BallaCsaba BiróTibor TajtiZijian Gyozo YangImre BajákPublished in: SYNASC (2020)
Keyphrases
- sat solvers
- sat instances
- unsatisfiable cores
- boolean satisfiability
- phase transition
- sat problem
- orders of magnitude
- random sat
- max sat
- propositional satisfiability
- satisfiability problem
- constraint satisfaction
- boolean formula
- search tree
- search strategies
- randomly generated
- search space
- random sat instances
- stochastic local search
- computational properties
- symmetry breaking
- constraint satisfaction problems
- evolutionary algorithm
- constraint programming
- tabu search
- np complete