Analysing Vote Counting Algorithms via Logic And Its Application to the CADE Election System
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|
|01_Beckert_Analysing_Vote_Counting_2013.pdf||3.77 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.