License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2018.3
URN: urn:nbn:de:0030-drops-98694
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9869/
Zhang, Zhizheng
Introspecting Preferences in Answer Set Programming
Abstract
This paper develops a logic programming language, ASP^EP, that extends answer set programming language with a new epistemic operator >~_x where x in {#,supseteq}. The operator are used between two literals in rules bodies, and thus allows for the representation of introspections of preferences in the presence of multiple belief sets: G >~_# F expresses that G is preferred to F by the cardinality of the sets, and G >~_supseteq F expresses G is preferred to F by the set-theoretic inclusion. We define the semantics of ASP^EP, explore the relation to the languages of strong introspections, and study the applications of ASP^EP by modeling the Monty Hall problem and the principle of majority.
BibTeX - Entry
@InProceedings{zhang:OASIcs:2018:9869,
author = {Zhizheng Zhang},
title = {{Introspecting Preferences in Answer Set Programming}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {3:1--3:13},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Alessandro Dal Palu' and Paul Tarau and Neda Saeedloei and Paul Fodor},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9869},
URN = {urn:nbn:de:0030-drops-98694},
doi = {10.4230/OASIcs.ICLP.2018.3},
annote = {Keywords: Answer Set, Preference, Introspection}
}
Keywords: |
|
Answer Set, Preference, Introspection |
Collection: |
|
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
19.11.2018 |