Skip Navigation



Journal of Logic and Computation Advance Access published online on November 6, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp071
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Costantini, S.
Right arrow Articles by Formisano, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Answer Set Programming with Resources

Stefania Costantini

Dipartimento di Informatica, Università di L’Aquila, via Vetoio, I-67010 L’Aquila, Italy.
E-mail: stefcost{at}di.univaq.it

Andrea Formisano

Dipartimento di Matematica e Informatica, Università di Perugia, via Vanvitelli, 1, I-06123 Perugia, Italy.
E-mail: formis{at}dipmat.unipg.it

Received 1 January 2008.


  Abstract

In this article, 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 introducing special atoms, called amount-atoms, to which we associate quantities that represent the available amount of a certain resource. The ‘firing’of aRASP 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 available 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 implementation 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.

Keywords: Answer set programming; non-monotonic logic programming; quantitative reasoning; language extensions


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.