Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API.
Florian LonsingUwe EglyPublished in: SAT (2015)
Keyphrases
- unsatisfiable cores
- boolean formula
- quantified boolean formulas
- sat solvers
- conjunctive normal form
- np complete
- boolean satisfiability
- practical problems
- boolean variables
- linear constraints
- membership queries
- sat problem
- max sat
- propositional satisfiability
- binary decision diagrams
- boolean functions
- sat instances
- davis putnam
- maximum satisfiability
- randomly generated
- hidden structure
- cnf formula
- optimization problems