Skip to content

Minimal cuts

Minimal exclusion sets

Which inclusion-minimal sets of exclusions remove all known admissible foundations of the target? And which set is cheapest?

Constraints
Candidates

All relevant (chosen by the server) · Tick to restrict the search to these candidates. With none ticked the server takes every relevant one.

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.