Social choice methods for database aggregation
File(s)
Published version
Author(s)
Belardinelli, Francesco
Grandi, Umberto
Type
Conference Paper
Abstract
Knowledge can be represented compactly in multiple ways, from aset of propositional formulas, to a Kripke model, to a database. Inthis paper we study the aggregation of information coming frommultiple sources, each source submi ing a database modelled asa rst-order relational structure. In the presence of integrity con-straints, we identify classes of aggregators that respect them in theaggregated database, provided these are satis ed in all individualdatabases. We also characterise languages for rst-order querieson which the answer to a query on the aggregated database coin-cides with the aggregation of the answers to the query obtained oneach individual database. is contribution is meant to be a rststep on the application of techniques from social choice theory toknowledge representation in databases.
Date Issued
2019-07-22
Date Acceptance
2019-05-24
Citation
Electronic Proceedings in Theoretical Computer Science, EPTCS, 2019, 297, pp.50-67
ISSN
2075-2180
Publisher
Open Publishing Association
Start Page
50
End Page
67
Journal / Book Title
Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume
297
Copyright Statement
© F. Belardinelli & U. GrandiThis work is licensed under the Creative Commons Attribution License.
License URL
Source
Theoretical Aspects of Reasoning about Knowledge (TARK 2019)
Publication Status
Published
Start Date
2019-07-17
Finish Date
2019-07-19
Coverage Spatial
Toulouse, France