On the minimum number of logical clauses inferred from examples

Given two sets of positive and negative examples, the inductive inference problem is to inger a small set of logical clauses which appropriately classify the examples. A graph theoretic approach is used to establish a lower limit on the minimum number of required clauses. Furthermore, the findings of this paper reveal methods for partitioning the original data and thus solving efficiently large scale problems.