We demonstrate how relation algebra and a supporting tool can be combined to solve problems of voting systems. We model plurality voting within relation algebra and present relation-algebraic specifications for some computational tasks. They can be transformed immediately into the programming language of the BDD-based Computer Algebra system
, such that this tool can be used to solve the problems in question and to visualize the computed results. The approach is extremely formal, very flexible and especially appropriate for prototyping, experimentation, scientific research, and education.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten