If we take s={i}, than xi_x[n]\{i}|xi ( and so Xi_X{not s}|Xs) in Idsep, since Xi is in s, contained in any path from it, and does not in v-structure.

If so, it also looked like a minimal MB, which I guess it's not….

I guess the definition of d-separating is missing:

X,Y are d-separated by Z in V\{X,Y}. (As written in some articles)

Moreover, I think there is a mistake at the notes page 5:

X_Y|Z in IdsepG if every path is not active regard to Z, which means it either has a node in Z that is not in a v structure or it has a node outside of Z that is in v-structure and *all its descendants are out of Z*

(The negation of the active path definition)

]]>Thanks :)

]]>ok? ]]>

I don't understand if we need to really solve the problem or just represent it in a form that we can calculate, i.e i can represent the problem formally, but in order to solve it i need to describe an algorithm, which i think i can do but not sure if i were asked for it.

Do we need to describe the algorithm solving the problem or not?

was my question clear enough?