Abstract Given an unsatisfiable Boolean formula F in CNF, subset of clauses U is called Minimal Unsatisfiable Subset (MUS) if every proper satisfiable. Since MUSes serve as explanations for the unsatisfiability , find applications a wide variety domains. The availability efficient SAT solvers has aided development scalable techniques finding and enumerating past two decades. Building on recent ...