A Deductive Database Solution to the Preferential Vote Counting Problem.
David B. Kemp, Kotagiri Ramamohanarao · 1994
To solve many complex database problems it is necessary to use recursive aggregatation. However, most existing deductive database implementations either cannot handle recursive aggregation, or do so in a very inefficient manner. To address this problem, efficient evaluation techniques were recently proposed in [5] for a class of programs called EMS-programs. We demonstrate the power of these techniques by solving a complex problem --- the problem of vote counting in a preferential election system. 1 Introduction Efficient evaluation techniques have been developed for a class of programs that are modularly stratified [13] in a very explicit manner --- these are called EMS-programs (Explicitly Modularly Stratified) [5]. Although the syntactic conditions that EMS-programs must satisfy are very strict, the conditions are independent of the extensional database (EDB) and, as shown by the large example given in Section 5, it is quite easy to express very complex problems in this manner 1 ...