The following pages link to Fast, flexible MUS enumeration (Q272009):
Displaying 24 items.
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Progress towards the Holy Grail (Q1616388) (← links)
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems (Q1664711) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Debugging unsatisfiable constraint models (Q2011577) (← links)
- Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds (Q2030469) (← links)
- Timed automata relaxation for reachability (Q2044206) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Strong inconsistency (Q2321259) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Enumeration of minimal models and MUSes in WASP (Q2694547) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- (Q3384086) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (Q4571130) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- (Q5101345) (← links)
- An Automata View to Goal-Directed Methods (Q5738990) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
