[Zurück]

G. Charwat, A. Pfandler:
"Democratix: A Declarative Approach to Winner Determination";
Vortrag: 4th International Conference on Algorithmic Decision Theory, ADT 2015, Lexington, Kentucky, USA; 27.09.2015 - 30.09.2015; in: "Algorithmic Decision Theory, 4th International Conference, ADT 2015 Lexington, KY, USA, September 27 - 30, 2015 Proceedings", T. Walsh (Hrg.); Springer, Lecture Notes in Computer Science Volume 9346 (2015), ISBN: 978-3-319-23113-6; S. 253 - 269.

Computing the winners of an election is an important task in voting and preference aggregation. The declarative nature of answer-set programming (ASP) and the performance of state-of-the-art solvers render ASP very well-suited to tackle this problem. In this work we present a novel, reduction-based approach for a variety of voting rules, ranging from tractable cases to problems harder than NP. The encoded voting rules are put together in the extensible tool Democratix, which handles the computation of winners and is also available as a web application. To learn more about the capabilities and limits of the approach, the encodings are evaluated thoroughly on real-world data as well as on random instances.

http://dx.doi.org/10.1007/978-3-319-23114-3_16

Projektleitung Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen

Projektleitung Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen

Projektleitung Stefan Woltran:
START