Finding an HLRT wrapper: Algorithm
naïve algorithm enumerate all combinations for each candidate l1 for each candidate r1 ··· for each candidate lK for each candidate rK for each candidate h for each candidate t succeed if consistent with examples
S = length of examples K = # attributes