Theoretical Computer Science
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Preference queries in deductive databases
New Generation Computing
Preference logic grammars: fixed point semantics and application to data standardization
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Mode-directed preferences for logic programs
Proceedings of the 2005 ACM symposium on Applied computing
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
Planning with preferences using logic programming
Theory and Practice of Logic Programming
The Description Logic Handbook
The Description Logic Handbook
Logic programming and nonmonotonic reasoning: from theory to systems and applications
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A 25-year perspective on logic programming
25 years of applications of logic programming in Italy
A 25-year perspective on logic programming
Nested Preferences in Answer Set Programming
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Strong equivalence of RASP programs
Correct Reasoning
Dealing with explicit preferences and uncertainty in answer set programming
Annals of Mathematics and Artificial Intelligence
Complex reactivity with preferences in rule-based agents
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
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.