Factoring Out Assumptions to Speed Up MUS Extraction
From MaRDI portal
Publication:5326470
DOI10.1007/978-3-642-39071-5_21zbMATH Open1390.68601OpenAlexW2167400570MaRDI QIDQ5326470FDOQ5326470
Authors: Jean-Marie Lagniez, Armin Biere 
Publication date: 5 August 2013
Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_21
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)
- Conformant planning as a case study of incremental QBF solving
- Speeding up assumption-based SAT
- Memory-limited model-based diagnosis
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Definability for model counting
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Speeding up MUS extraction with preprocessing and chunking
- SAT-Based Horn Least Upper Bounds
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Efficient SAT solving under assumptions
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
Uses Software
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)
