ACM Transactions on Database Systems (TODS)
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs
Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Preferred Answer Sets for Ordered Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of the comparison method of the Answer Set Optimization semantics [4] is presented. The paper introduces the concept of choice, as a set of preference rules describing common choice options in different contexts. Thus, intuitively, in the proposed approach the preference rules are not evaluated separately; but the subset of rules, related to the same choice are individuated and the choice instead of rule satisfaction is considered. The role of constraints in the feasibility of choice options is then investigated and an alternative semantics, evaluating choices on the basis of their really possible (allowed) options, is developed. Complexity analysis is also performed showing that the introduction of choices does not increase the complexity of computing preferred stable models.