Name
Abstract | ||
|---|---|---|
In this article, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit preference relations are presented. We study essential properties of the proposed preferred answer set semantics. To understand the expressiveness of preferred first-order answer set programming, we further specify a second-order logic representation which precisely characterizes the progression-based preference semantics. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2579817 | ACM Trans. Comput. Log. |
Keywords | Field | DocType |
second-order logic representation,preferred first-order answer set,first-order answer set program,essential property,progression-based preference semantics,explicit preference relation,preference reasoning,proposed preferred answer set,answer set programming,second order logic | Discrete mathematics,Second-order logic,First order,Stable model semantics,Answer set programming,Semantics,Mathematics,Well-founded semantics,Expressivity | Journal |
Volume | Issue | ISSN |
15 | 2 | 1529-3785 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vernon Asuncion | 1 | 28 | 4.14 |
| Yan Zhang | 2 | 777 | 123.70 |
| Yi Zhou | 3 | 161 | 26.62 |