The following pages link to Towards efficient MUS extraction (Q3164969):
Displaying 21 items.
- Quantified maximum satisfiability (Q272016) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- On getting rid of the preprocessing minimization step in MUC-finding algorithms (Q903912) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Accelerating predicate abstraction by minimum unsatisfiable cores extraction (Q1980482) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Factoring Out Assumptions to Speed Up MUS Extraction (Q5326470) (← links)
- An Automata View to Goal-Directed Methods (Q5738990) (← links)
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets (Q6108818) (← links)
