MUP
From MaRDI portal
Cited in
(23)- An approach for extracting a small unsatisfiable core
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- CEGAR
- TSPASS
- CMU Benchmarks
- AMUSE
- Local-search extraction of mUSes
- SATLIB Benchmark Suite
- Algorithms for computing minimal unsatisfiable subsets of constraints
- VaqUoT
- TRP++
- VaqTree
- Extracting unsatisfiable cores for LTL via temporal resolution
- Computing small unsatisfiable cores in satisfiability modulo theories
- On improving MUS extraction algorithms
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- Improved single pass algorithms for resolution proof reduction
- Resolution proof transformation for compression and interpolation
- Does This Set of Clauses Overlap with at Least One MUS?
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
This page was built for software: MUP
