License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05171.3
URN: urn:nbn:de:0030-drops-2624
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/262/
Go to the corresponding Portal |
Grabos, Rafal
Answer Set Programming and Combinatorial Voting
Abstract
We show how Logic Programming with Ordered
Disjunction (LPOD), the extension of answer
set programming for handling preferences, may
be used for representing and solving collective
decision making problems. We present the
notion of combinatorial vote problem in the
context of LPOD and define various types of
vote rules, used as decision criteria for
determining optimal candidate for a group of voters.
15 min presentation
BibTeX - Entry
@InProceedings{grabos:DagSemProc.05171.3,
author = {Grabos, Rafal},
title = {{Answer Set Programming and Combinatorial Voting}},
booktitle = {Nonmonotonic Reasoning, Answer Set Programming and Constraints},
pages = {1--15},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5171},
editor = {Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/262},
URN = {urn:nbn:de:0030-drops-2624},
doi = {10.4230/DagSemProc.05171.3},
annote = {Keywords: Decision making, answer set programming, preferences}
}
Keywords: |
|
Decision making, answer set programming, preferences |
Collection: |
|
05171 - Nonmonotonic Reasoning, Answer Set Programming and Constraints |
Issue Date: |
|
2005 |
Date of publication: |
|
14.09.2005 |