Several pre-model will be produced. Proposition 1 can be generalized (to non-complete situation) with P_M defined as below
Description of P_M:
For any link from o to N (non-source node), o not linking to anything below N,
Let L1 to Lk be leaves of node N, add to PM
is_a(o, L1) or ... or is_a(o, Lk).
Several pre-model will be produced. Proposition 1 can be generalized (to non-complete situation) with P_M defined as below