Given a triple <x i , r, x j >, we identify the set Ψ r full of all paths ψ i,j such that ψ i,j indicates r i,j and ψ i,j 's sequence of relations {R i,i+1 .. R j-1,j } matches one of the allowed sequences.
we only consider certain path types.