License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-2624
URL: http://drops.dagstuhl.de/opus/volltexte/2005/262/

Grabos, Rafal

Answer Set Programming and Combinatorial Voting

pdf-format:
Dokument 1.pdf (152 KB)


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:DSP:2005:262,
  author =	{Rafal Grabos},
  title =	{Answer Set Programming and Combinatorial Voting},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  year =	{2005},
  editor =	{Gerhard Brewka and Ilkka Niemel{\"a} and Torsten Schaub and Miroslaw Truszczynski},
  number =	{05171},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/262},
  annote =	{Keywords: Decision making, answer set programming, preferences}
}

Keywords: Decision making, answer set programming, preferences
Seminar: 05171 - Nonmonotonic Reasoning, Answer Set Programming and Constraints
Issue date: 2005
Date of publication: 14.09.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI