Graphically, this restriction can be characterized as follows: Recall that not every set of positive literals involving A, /~, and -~ is a legal d-tree.
we can show that a description is a d-tree if and only if it is logically equivalent to descriptions that, when written graphically, would have the appearance described above.