Affiliations: Dipartimento di Informatica, Universita di L'Aquila, Via Vetoio, 67010 L'Aquila, Italy. Stefania.Costantini@univaq.it | Dipartimento di Matematica e Informatica, Universita di Perugia, Via Vanvitelli 1, 06123 Perugia, Italy. formis@dmi.unipg.it; davide.petturiti@dmi.unipg.it
Note: [] Address for correspondence: Dipartimento di Informatica, Università di L'Aquila, Piazza Vincenzo Rivera, 1 - 67100, Italy
Abstract: In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and consumption of (amounts of) resources. The approach combines answer set semantics with quantitative reasoning and relies on an algebraic structure to support computations and comparisons of amounts. The RASP framework provides some form of preference reasoning on resources usage. In this paper, we go further in this direction by introducing expressive constructs for supporting complex preferences specification on aggregate resources. We present a refinement of the semantics of RASP so as to take into account the new constructs. For all the extensions, we provide an encoding into plain ASP. We prove that the complexity of establishing the existence of an answer set, in such an enriched framework, remains NP-complete as in ASP. Finally, we report on raspberry, a prototypical implementation of RASP. This tool consists of a compiler that, given a ground RASP program, produces a pure ASP encoding suitable to be processed by commonly available ASP-solvers.
Keywords: Answer set programming, quantitative reasoning, preferences, language extensions
