AMUSE
From MaRDI portal
Software:23851
No author found.
Related Items (24)
Counting minimal unsatisfiable subsets ⋮ Hints Revealed ⋮ Local-search extraction of mUSes ⋮ Factoring Out Assumptions to Speed Up MUS Extraction ⋮ Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction ⋮ Searching for Autarkies to Trim Unsatisfiable Clause Sets ⋮ MUST: Provide a Finer-Grained Explanation of Unsatisfiability ⋮ Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ Resolution proof transformation for compression and interpolation ⋮ Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories ⋮ Theory and Applications of Satisfiability Testing ⋮ On Improving MUS Extraction Algorithms ⋮ Faster Extraction of High-Level Minimal Unsatisfiable Cores ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ Improved Single Pass Algorithms for Resolution Proof Reduction ⋮ Decision procedures. An algorithmic point of view ⋮ A Scalable Algorithm for Minimal Unsatisfiable Core Extraction ⋮ A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories ⋮ 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 ⋮ Efficient Combination of Decision Procedures for MUS Computation ⋮ Using local search to find MSSes and MUSes ⋮ Unnamed Item
This page was built for software: AMUSE
