Talks and Poster Presentations (with Proceedings-Entry):

M. Bernreiter, J. Maly, S. Woltran:
"Encoding Choice Logics in ASP";
Talk: ICLP 2020, Rende, Italien; 2020-09-18 - 2020-09-24; in: "International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020", (2020), 1 - 14.

English abstract:
Choice Logics are a tool to express and reason about preferences.
A choice logic extends classical propositional logic by adding
non-classical binary connectives which express a certain form of ordering over interpretations that satisfy the connective; examples in the literature are Qualitative Choice Logic (QCL) which introduces the concept of ordered disjunction and Conjunctive Choice Logic (CCL) where an ordered variant of conjunction has been proposed. These logics have in common that interpretations ascribe a natural number, called satisfaction degree, to formulas; the lower this satisfaction degree, the more preferable the interpretation. In this paper, we present a general framework to capture several such logics and show how choice logics de ned in our framework can be encoded using Answer Set Programming. (ASP)

Preferences, Choice Logics, Answer Set Programming

Related Projects:
Project Head Stefan Woltran:

Created from the Publication Database of the Vienna University of Technology.