AMUSE
From MaRDI portal
Software:23851
swMATH11915MaRDI QIDQ23851FDOQ23851
Author name not available (Why is that?)
Cited In (24)
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- On Improving MUS Extraction Algorithms
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Counting minimal unsatisfiable subsets
- Hints Revealed
- Resolution proof transformation for compression and interpolation
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Improved Single Pass Algorithms for Resolution Proof Reduction
- Factoring Out Assumptions to Speed Up MUS Extraction
- Algorithms for computing minimal unsatisfiable subsets of constraints
- An approach for extracting a small unsatisfiable core
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Using local search to find MSSes and MUSes
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Efficient Combination of Decision Procedures for MUS Computation
- Local-search extraction of mUSes
- Decision procedures. An algorithmic point of view
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
This page was built for software: AMUSE
