Abstract
We present a method for using first-order logic to specify the semantics of preferences as used in common vote counting algorithms. We also present a corresponding system that uses Celf linear-logic programs to describe voting algorithms and which generates explicit examples when the algorithm departs from its specification. When we applied our method and system to analyse the vote counting algorithm used for electing the CADE Board of Trustees, we found that it strictly differs from the standard definition of Single Transferable Vote (STV). We therefore argue that “STV” is a misnomer for the CADE algorithm.
Originalsprog | Engelsk |
---|---|
Titel | Automated Deduction – CADE-24 : Proceedings of the 16th International Conference on Automated Deduction (CADE-24) |
Forlag | Springer |
Publikationsdato | 2013 |
Sider | 135-144 |
ISBN (Trykt) | 978-3-642-38573-5 |
ISBN (Elektronisk) | 978-3-642-38574-2 |
DOI | |
Status | Udgivet - 2013 |
Begivenhed | The 24th International Conference on Automated Deduction - Lake Placid, NY, USA, USA Varighed: 9 jun. 2013 → 14 jun. 2013 http://www.cl.cam.ac.uk/~gp351/cade24/ |
Konference
Konference | The 24th International Conference on Automated Deduction |
---|---|
Land/Område | USA |
By | Lake Placid, NY, USA |
Periode | 09/06/2013 → 14/06/2013 |
Internetadresse |
Navn | Lecture Notes in Computer Science |
---|---|
Vol/bind | 7898 |
ISSN | 0302-9743 |