The following pages link to MUP (Q23846):
Displayed 15 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Resolution proof transformation for compression and interpolation (Q479815) (← 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)
- 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)
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (Q3612475) (← links)
- Improved Single Pass Algorithms for Resolution Proof Reduction (Q4649291) (← links)
- Does This Set of Clauses Overlap with at Least One MUS? (Q5191099) (← links)
- Theory and Applications of Satisfiability Testing (Q5713708) (← links)
- Theory and Applications of Satisfiability Testing (Q5713745) (← links)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (Q5756585) (← links)