Minimal cuts
Minimal exclusion sets
Which inclusion-minimal sets of exclusions remove all known admissible foundations of the target? And which set is cheapest?
All inclusion-minimal sets of exclusions that remove every known admissible basis of the target.
One set of lowest cost given the chosen candidates, weights and largest size.
This is not an ordinary graph cut: AND/OR arguments, leaf origins and alternatives are taken into account.