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

Beckert, Bernhard; Gore, Rajeev; Schurmann, Carsten

doi:10.1007/978-3-642-38574-2_9

A change is coming. Click to see a sneak peek of the new Open Research Repository.

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

Request a Copy

link to publisher version

Altmetric Citations

Beckert, Bernhard; Gore, Rajeev; Schurmann, Carsten

Description

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

Collections	ANU Research Publications
Date published:	2013
Type:	Conference paper
URI:	http://hdl.handle.net/1885/66185
Source:	CADE 2013
DOI:	10.1007/978-3-642-38574-2_9

Download

File	Description	Size	Format	Image
01_Beckert_Analysing_Vote_Counting_2013.pdf		3.77 MB	Adobe PDF	Request a copy

Show full item record

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

Altmetric Citations

Description

Download