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