Login / Signup
Faster Extraction of High-Level Minimal Unsatisfiable Cores.
Vadim Ryvchin
Ofer Strichman
Published in:
SAT (2011)
Keyphrases
</>
unsatisfiable cores
high level
max sat
hidden structure
boolean satisfiability
maximum satisfiability
branch and bound algorithm
lower bound
sat solvers
graph coloring
optimization problems
phase transition
sat problem
propositional satisfiability