Comparing Different Graph Representations of Logic Programs under the Answer Set Semantics

In this paper we try a formalization of the features that a graph representation of logic programs should exhibit. On the basis of this formalization, we compare three graph representations: the DG, the EDG and the RG.