To put this idea into practice, we provide a software framework named CIfly, that is build directly on top of such rule tables. The 'reach' function returns all nodes found by the graph search specified with the rule table. Thus, a d-separation check takes just a few lines of Python or R code.

We introduce a framework for expressing such tasks through rule tables. A rule table encodes a graph search, such as the one for d-connectivity below. As familiar, the rules prescribes walking along colliders, if they are in the conditioning set Z, and for non-colliders, in case they are not in Z.