Social Choice Methods for Database Aggregation

Francesco Belardinelli
(Department of Computing, Imperial College London, UK and Laboratoire IBISC, University of Evry, France)
Umberto Grandi
(IRIT, University of Toulouse, France)

Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a database modelled as a first-order relational structure. In the presence of integrity constraints, we identify classes of aggregators that respect them in the aggregated database, provided these are satisfied in all individual databases. We also characterise languages for first-order queries on which the answer to a query on the aggregated database coincides with the aggregation of the answers to the query obtained on each individual database. This contribution is meant to be a first step on the application of techniques from social choice theory to knowledge representation in databases.

In Lawrence S. Moss: Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2019), Toulouse, France, 17-19 July 2019, Electronic Proceedings in Theoretical Computer Science 297, pp. 50–67.
Published: 19th July 2019.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: