A 25-year perspective on logic programming
Strong equivalence of RASP programs
Correct Reasoning
Complex reactivity with preferences in rule-based agents
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
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.