2005/01/01 by Rafał Graboś, Grabos, Rafal
Computer Science · #Constraint Satisfaction and Optimization #Decision making #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #answer set programming #preferences
paper · doi:10.4230/dagsemproc.05171.3
openalex publication_date 2005/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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