Graph representations of logic programs: properties and comparison

In this paper, we propose a formalization of the features that a graph representation of logic programs under the answer set semantics should in our opinion exhibit in order to be a satisfactory and useful representation formalism. We introduce a concept of isomorphism between a program and the corresponding graph. We show the importance of isomorphism for program analysis and we compare different graph representations w.r.t. isomorphism.