MUSer2
From MaRDI portal
Software:25317
swMATH13403MaRDI QIDQ25317FDOQ25317
Author name not available (Why is that?)
Cited In (13)
- Parallel MUS extraction
- On computing minimal independent support and its applications to sampling and counting
- Counting minimal unsatisfiable subsets
- Fast, flexible MUS enumeration
- Supercharging plant configurations using Z3
- Finding boundary elements in ordered sets with application to safety and requirements analysis
- A new approach to partial MUS enumeration
- Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
- Definability for model counting
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- Optimal bounds for the no-show paradox via SAT solving
- Speeding up MUS extraction with preprocessing and chunking
- Mining backbone literals in incremental SAT. A new kind of incremental data
This page was built for software: MUSer2
