Faster Extraction of High-Level Minimal Unsatisfiable Cores
From MaRDI portal
Publication:3007682
DOI10.1007/978-3-642-21581-0_15zbMATH Open1331.68211OpenAlexW144339668MaRDI QIDQ3007682FDOQ3007682
Authors: Vadim Ryvchin, Ofer Strichman 
Publication date: 17 June 2011
Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_15
Recommendations
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Verification, Model Checking, and Abstract Interpretation
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- An approach for extracting a small unsatisfiable core
Cites Work
- The complexity of facets resolved
- Algorithms for computing minimal unsatisfiable subsets of constraints
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Title not available (Why is that?)
- Interpolation and SAT-based model checking.
- Temporal induction by incremental SAT solving
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Finding Guaranteed MUSes Fast
- Title not available (Why is that?)
- An approach for extracting a small unsatisfiable core
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
Cited In (21)
- Quantified maximum satisfiability
- Speeding up assumption-based SAT
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Computing small unsatisfiable cores in satisfiability modulo theories
- A fast counterexample minimization algorithm with refutation analysis and incremental SAT
- Verification, Model Checking, and Abstract Interpretation
- Anytime answer set optimization via unsatisfiable core shrinking
- Efficient generation of small interpolants in CNF
- An approach for extracting a small unsatisfiable core
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- 2QBF: challenges and solutions
- Debugging design errors by using unsatisfiable cores
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
- Speeding up MUS extraction with preprocessing and chunking
- Hints revealed
- Mining backbone literals in incremental SAT. A new kind of incremental data
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
Uses Software
This page was built for publication: Faster Extraction of High-Level Minimal Unsatisfiable Cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007682)
