The Minimal Unsatisfiable Subset (MUS) is a core concept in constraint satisfaction problems, referring to the smallest subset of an unsatisfiable constraint set such that removing any single constraint makes the whole set satisfiable; finding all MUSes and providing the optimal deletion plan is inherently NP-hard combinatorial optimization.