Work

Answer Set Programming and Combinatorial Voting

Year: 2005
Type: article
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
Institution: Leipzig University
Language: English
Open Access status: green
OpenAlex ID: W2139169690
FWCI:
Cites: 12
Cited by:
Related to: 10