MUSer2: an efficient MUS extractor
From MaRDI portal
Recommendations
Cited in
(28)- Optimal bounds for the no-show paradox via SAT solving
- Supercharging plant configurations using Z3
- Definability for model counting
- Local-search extraction of mUSes
- MUSer2
- On computing minimal independent support and its applications to sampling and counting
- Fast, flexible MUS enumeration
- Finding a collection of MUSes incrementally
- On improving MUS extraction algorithms
- Towards efficient MUS extraction
- On computing preferred MUSes and MCSes
- Condorcet's principle and the preference reversal paradox
- Speeding up MUS extraction with preprocessing and chunking
- Mining backbone literals in incremental SAT. A new kind of incremental data
- A new approach to partial MUS enumeration
- Efficient combination of decision procedures for MUS computation
- Finding boundary elements in ordered sets with application to safety and requirements analysis
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Formula preprocessing in MUS extraction
- Parallel MUS extraction
- Theory and Applications of Satisfiability Testing
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Computing minimal unsatisfiable core for LTL over finite traces
- Rotation based MSS/MCS enumeration
- Counting minimal unsatisfiable subsets
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
This page was built for publication: MUSer2: an efficient MUS extractor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194802)
