Factoring Out Assumptions to Speed Up MUS Extraction
From MaRDI portal
Recommendations
- Towards efficient MUS extraction
- Speeding up MUS extraction with preprocessing and chunking
- On improving MUS extraction algorithms
- Formula preprocessing in MUS extraction
- On efficient computation of variable MUSes
- Parallel MUS extraction
- Efficient combination of decision procedures for MUS computation
- MUS Extraction Using Clausal Proofs
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
Cited in
(12)- Assessing progress in SAT solvers through the Lens of incremental SAT
- Memory-limited model-based diagnosis
- Speeding up assumption-based SAT
- Definability for model counting
- Conformant planning as a case study of incremental QBF solving
- Efficient SAT solving under assumptions
- Speeding up MUS extraction with preprocessing and chunking
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- SAT-Based Horn Least Upper Bounds
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
This page was built for publication: Factoring Out Assumptions to Speed Up MUS Extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326470)
