Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
429322 | Journal of Algorithms | 2009 | 13 Pages |
In this paper, we extend our previous work on Resourced ASP, or for short RASP, where we have introduced the possibility of defining and using resources in ASP. In RASP, one can define resources with their amounts, where available resources can be used for producing other resources and the remaining amount, if any, can be used in a different way. In this paper, we introduce P-RASP (RASP with Preferences) where it is possible to express preferences about which resources should be either consumed or produced. Moreover, conditional preferences, of different forms, allow one to express preferences according to certain conditions, that are to be evaluated “dynamically”, namely, with respect to the specific answer set at hand. The semantic of conditional preferences is given in terms of (non-conditional) preferences, though the translation is not straightforward and thus the new features are not syntactic sugar. Complexity of P-RASP is also discussed.