Minimizing counterexample with unit core extraction and incremental SAT
From MaRDI portal
Recommendations
- A fast counterexample minimization algorithm with refutation analysis and incremental SAT
- Correct Hardware Design and Verification Methods
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Tools and Algorithms for the Construction and Analysis of Systems
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
Cited in
(5)- Minimal sets on propositional formulae. Problems and reductions
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Tools and Algorithms for the Construction and Analysis of Systems
- A fast counterexample minimization algorithm with refutation analysis and incremental SAT
This page was built for publication: Minimizing counterexample with unit core extraction and incremental SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711497)