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.
Original language | English |
---|---|
Article number | 11 |
Number of pages | 42 |
Journal | ACM Transactions on Computational Logic |
Volume | 15 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2014 |
Keywords
- artificial intelligence
- logic programming