RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specication and reasoning on consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In doing that, we introduce a linear logic represen- tation of default negation as understood in Answer Set Programming. We are also able to establish a link between linear logic and HT-logic.
RASP and ASP as a fragment of linear logic
COSTANTINI, STEFANIA;
2013-01-01
Abstract
RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specication and reasoning on consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In doing that, we introduce a linear logic represen- tation of default negation as understood in Answer Set Programming. We are also able to establish a link between linear logic and HT-logic.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
