DROPS

Document

Answer Set Programming and Combinatorial Voting

Authors: Rafal Grabos

Published in: Dagstuhl Seminar Proceedings, Volume 5171, Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)

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

Cite as

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)

Copy BibTex To Clipboard

@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/entities/document/10.4230/DagSemProc.05171.3},
  URN =		{urn:nbn:de:0030-drops-2624},
  doi =		{10.4230/DagSemProc.05171.3},
  annote =	{Keywords: Decision making, answer set programming, preferences}
}

Search Results

Documents authored by Grabos, Rafal

Answer Set Programming and Combinatorial Voting

Abstract

Cite as

Thanks for your feedback!

Could not send message