Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API.
Florian LonsingUwe EglyPublished in: CoRR (2015)
Keyphrases
- unsatisfiable cores
- boolean formula
- quantified boolean formulas
- sat solvers
- practical problems
- np complete
- boolean satisfiability
- max sat
- linear constraints
- conjunctive normal form
- boolean variables
- membership queries
- binary decision diagrams
- boolean functions
- sat problem
- orders of magnitude
- sat instances
- cnf formula
- davis putnam
- uniform distribution
- clause learning
- satisfiability problem
- constraint satisfaction