Answer Set Programming with Resources
Stefania Costantini, Andrea Formisano · Journal of Logic and Computation · 2009
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 “Re-sourced ASP”. Resources are modeled by introducing special atoms, called amount-atoms, to which we associate quantities that represent the avail-able amount of a certain resource. The “firing ” of a RASP-rule involving amount-atoms can both consume and produce resources. A RASP-rule can be fired several times, according to its definition and to the avail-able quantities of required resources. We define the semantics for RASP programs by extending the usual answer set semantics. Different answer sets correspond to different possible allocations of available resources. We then propose an implementation based on standard ASP-solvers. The im-plementation consists of a standard translation of each RASP-rule into a set of plain ASP rules and of an inference engine that manages the firing of RASP-rules. Key words: Answer set programming, non-monotonic logic program-