Enumerating infeasibility: finding multiple MUSes quickly
From MaRDI portal
Recommendations
Cited in
(23)- Minimal sets on propositional formulae. Problems and reductions
- Improving MCS enumeration via caching
- Introducing Pareto minimal correction subsets
- Debugging unsatisfiable constraint models
- SAT-based rigorous explanations for decision lists
- Memory-limited model-based diagnosis
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Fast, flexible MUS enumeration
- Finding a collection of MUSes incrementally
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- A new approach to partial MUS enumeration
- Finding Guaranteed MUSes Fast
- Tunable online MUS/MSS enumeration
- Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets
- Human-centred feasibility restoration in practice
- Efficiently Characterizing the Undefined Requests of a Rule-Based System
- Recursive online enumeration of all minimal unsatisfiable subsets
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Anytime approximate formal feature attribution
- Explanations of unsatisfiability beyond minimal subsets
- Rotation based MSS/MCS enumeration
- Stream-based inconsistency measurement
This page was built for publication: Enumerating infeasibility: finding multiple MUSes quickly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922910)