On the equivalence and range of applicability of graph-based representations of logic programs

Authors:
Stefania Costantini;Ottavio D'Antona;Alessandro Provetti
Affiliations:
Dip. di Informatica, Università degli Studi di L'Aquila, Via Vetoio Loc. Coppito, L'Aquila, 1-67100 Italy;Dip. di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39/41 Milan, I-20135 Italy;Dip. di Fisica, Università degli Studi di Messina, Salita Sperone 31 Messina, 1-98166 Italy
Venue:
Information Processing Letters
Year:
2002

Citing 10
Cited 4

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The expressive powers of the logic programming semantics

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Contributions to the stable model semantics of logic programs with negation

Theoretical Computer Science
Graph theoretical structures in logic programs and default theories

Theoretical Computer Science
Answer set planning

Proceedings of the 1999 international conference on Logic programming
On the Expressibility of Stable Logic Programming

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Transformation-based bottom-up computation of the well-founded model

Theory and Practice of Logic Programming
Normal forms for answer sets programming

Theory and Practice of Logic Programming
On the existence of stable models of non-stratified logic programs

Theory and Practice of Logic Programming
Graph theoretical characterization and computation of answer sets

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Graphs and colorings for answer set programming

Theory and Practice of Logic Programming
On the existence of stable models of non-stratified logic programs

Theory and Practice of Logic Programming
Justifications for logic programs under answer set semantics

Theory and Practice of Logic Programming
Justifications for logic programs under answer set semantics

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 Linke [Proc. IJCAI-2001, 2001, pp. 641-648]. 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.