[2] Pruning Rule 3.2
(Pruning subsumed sets).
At a node v = {si sik} if
{si1,…sik} U Tail is a
subset of some maximal
coherent sample set, then
the subtree of the node
can be pruned.
Text Box: {}
CARPENTER Pruning
Method 2: if a rule is
discovered before, we
can prune enumeration
below this node
TT|{3,4}