Analysing Vote Counting Algorithms via Logic And Its Application to the CADE Election System

Beckert, Bernhard; Gore, Rajeev; Schurmann, Carsten

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Analysing Vote Counting Algorithms via Logic And Its Application to the CADE Election System

Date

2013

Authors

Beckert, Bernhard

Gore, Rajeev

Schurmann, Carsten

Publisher

Springer

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 generat