To answer question 1, we use the following arguments:

*from* Ex *to* Z can not produce information loss since all paths
from Ex to Z are possible in the graph. Therefore, UNKNOWN1* = NOTHING.


*from* Ex *bypassing* -> K,l,L *to* Z 
can not produce information loss since the bypassing restriction
can not produce extra paths in the propagation graph which violate
the bypassing.
Therefore, UNKNOWN3* = NOTHING.

cd5 does not contain a cycle and therefore the through or via
restriction cannot produce a path not satisfying the through
or via restriction.
Therefore, UNKNOWN*5 = NOTHING

Same argument holds for cd1.
Therefore, UNKNOWN*1 = NOTHING

Same argument holds for cd4.
Therefore, UNKNOWN*4 = NOTHING

UNKNOWN22= Ex A_PCList A Z
UNKNOWN23= Ex A_PCList A D K Z
UNKNOWN42= Ex A_PCList A Z
UNKNOWN43= Ex A_PCList A D K Z