The following pages link to AMUSE (Q23851):
Displayed 24 items.
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories (Q2996914) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- Hints Revealed (Q3453213) (← links)
- Searching for Autarkies to Trim Unsatisfiable Clause Sets (Q3502707) (← links)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability (Q3523066) (← links)
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (Q3612475) (← links)
- Efficient Combination of Decision Procedures for MUS Computation (Q3655210) (← links)
- Improved Single Pass Algorithms for Resolution Proof Reduction (Q4649291) (← links)
- Factoring Out Assumptions to Speed Up MUS Extraction (Q5326470) (← links)
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (Q5326472) (← links)
- (Q5421905) (← links)
- Theory and Applications of Satisfiability Testing (Q5713708) (← links)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (Q5756585) (← links)