Answer Set Programming and Combinatorial Voting
Rafał Graboś · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 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