These methods directly minimize the parsing complexity of the resulting deduction system.
each edge in G comes from a clique for some vertex v in G , so the edge has both its endpoints in any node of T corresponding to a node of T that contained v. T is a valid tree decomposition of G .