Democratix: A Declarative Approach to Winner Determination
- 28 August 2015
- book chapter
- Published by Springer Nature
- p. 253-269
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Answer Set Solving in PracticeSynthesis Lectures on Artificial Intelligence and Machine Learning, 2012
- On the approximability of Dodgson and Young electionsArtificial Intelligence, 2012
- Experiments with Kemeny ranking: What works when?Mathematical Social Sciences, 2012
- Team-building with answer set programming in the Gioia-Tauro seaportTheory and Practice of Logic Programming, 2011
- Parameterized computational complexity of Dodgson and Young electionsInformation and Computation, 2010
- Computer-aided proofs of Arrow's and other impossibility theoremsArtificial Intelligence, 2009
- The DLV system for knowledge representation and reasoningACM Transactions on Computational Logic, 2006
- The complexity of Kemeny electionsTheoretical Computer Science, 2005
- Exact analysis of Dodgson electionsJournal of the ACM, 1997
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991