Suppose have two positive examples e\(_1\)  = f([4,3,4,6],3) and e\(_2\)  = f([2,2,9,4,8,10],9) which correspond to odd elements in the second and third positions of a list respectively.
Also assume we have suitable negative examples and that we restrict hypotheses to definite programs [1]}.
Given these examples, our approach first learns a hypothesis (in this case a single rule) for each example:
<TABLE>