On the Equivalence and Range of Applicability of Graph-based Representations of Logic Programs