Answer Set Programming and Combinatorial Voting

Grabos, Rafal

doi:10.4230/DagSemProc.05171.3

Document

Answer Set Programming and Combinatorial Voting

Author Rafal Grabos

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 5171
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2005-09-14

PDF

File

DagSemProc.05171.3.pdf

Filesize: 151 kB
15 pages

Document Identifiers

DOI: 10.4230/DagSemProc.05171.3
URN: urn:nbn:de:0030-drops-2624

Author Details

Rafal Grabos

Cite As Get BibTex

Rafal Grabos. Answer Set Programming and Combinatorial Voting. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005) https://doi.org/10.4230/DagSemProc.05171.3

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

Subject Classification

Keywords

Decision making
answer set programming
preferences

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail