Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

View graph of relations

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.
Original languageEnglish
Title of host publicationAutomated Deduction – CADE-24 : Proceedings of the 16th International Conference on Automated Deduction (CADE-24)
Publication date2013
ISBN (Print)978-3-642-38573-5
ISBN (Electronic)978-3-642-38574-2
Publication statusPublished - 2013
EventThe 24th International Conference on Automated Deduction - Lake Placid, NY, USA, United States
Duration: 9 Jun 201314 Jun 2013


ConferenceThe 24th International Conference on Automated Deduction
LandUnited States
ByLake Placid, NY, USA
SeriesLecture Notes in Computer Science

ID: 78906097