Cited in
(37)- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- Counting minimal unsatisfiable subsets
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- An approach for extracting a small unsatisfiable core
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Resolution proof transformation for compression and interpolation
- HaifaSat
- CEGAR
- Factoring Out Assumptions to Speed Up MUS Extraction
- CMU Benchmarks
- MUP
- SATLIB Benchmark Suite
- RSat
- MUSer2
- Velev SAT Benchmarks
- BEACON
- Local-search extraction of mUSes
- On improving MUS extraction algorithms
- C32SAT
- QAGen
- Z34Bio
- QUICKXPLAIN
- Efficient combination of decision procedures for MUS computation
- Improved single pass algorithms for resolution proof reduction
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Decision procedures. An algorithmic point of view
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Hints revealed
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Theory and Applications of Satisfiability Testing
- Reconfigurable computing. The theory and practice of FPGA-based computation.
- Using local search to find MSSes and MUSes
- Computing small unsatisfiable cores in satisfiability modulo theories
This page was built for software: AMUSE
