whats the easiest way to find the fewest members p...

# announcements

[groostav]

whats the easiest way to find the fewest members possible such that the list is not OK. for example:

lets say that isOk(setOf(Thing(A), Thing(D)) returns false, (and therefore any super-sets of A and D will also return false) and I have the set setOf(Thing(A), Thing(B), Thing(C), Thing(D), ThingE))