RASP and ASP as a fragment of linear logic
Stefania Costantini, Andrea Formisano · Journal of Applied Non-Classical Logics · 2013
RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on the 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 so, we introduce a linear logic representation of default negation as understood in ASP. We are also able to establish a link between linear logic and here-and-there (HT) logic.