On the equivalence and range of applicability of graph-based representations of logic programs. (Q1853147): Difference between revisions

Logic programs under Answer Sets semantics can be studied, and actual computation can be carried out, by means of representing them by directed graphs. Several reductions of logic programs to directed graphs are now available. We compare our proposed representation, called extended dependency graph, to the block graph representation recently defined by \textit{Linke} [Proc. IJCAI-2001, 641--648 (2001)]. On the relevant fragment of well-founded irreducible programs, extended dependency and block graph turns out to be isomorphic. So, we argue that graph representation of general logic programs should be abandoned in favor of graph representation of well-founded irreducible programs, which are more concise, more uniform in structure while being equally expressive.