In this paper we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension RASP, standing for Resourced ASP. Resources are modeled by specific atoms, to which we associate quantities that represent the available amount. The firing of a RASP-rule can both consume and produce resources. We define the semantics for RASP programs by extending the usual answer set semantics and we propose an implementation based on standard ASP-solvers.
Answer Set Programming with Resources
FORMISANO, Andrea
2007
Abstract
In this paper we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension RASP, standing for Resourced ASP. Resources are modeled by specific atoms, to which we associate quantities that represent the available amount. The firing of a RASP-rule can both consume and produce resources. We define the semantics for RASP programs by extending the usual answer set semantics and we propose an implementation based on standard ASP-solvers.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.
