Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1244002.1244017 | SAC |
Keywords | Field | DocType |
different context,prioritized reasoning,alternative semantics,common choice option,comparison method,complexity analysis,logic programming,preference rule,preference condition,choice option,answer set optimization semantics,choice evaluation | Data mining,Computer science,Theoretical computer science,Stable model semantics,Logic programming,Semantics,Well-founded semantics | Conference |
ISBN | Citations | PageRank |
1-59593-480-4 | 0 | 0.34 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luciano Caroprese | 1 | 140 | 21.01 |
| Irina Trubitsyna | 2 | 119 | 24.66 |
| Ester Zumpano | 3 | 518 | 62.16 |