Answer Set Programming and Combinatorial Voting

Author Rafal Grabos

Thumbnail PDF


  • Filesize: 151 kB
  • 15 pages

Document Identifiers

Author Details

Rafal Grabos

Cite AsGet 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)


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
  • Decision making
  • answer set programming
  • preferences


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads