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.
Titolo: | Graph representations of logic programs: properties and comparison |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
Abstract: | 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. |
Handle: | http://hdl.handle.net/11570/1904913 |
Appare nelle tipologie: | 14.a.2 Proceedings in extenso su rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.