Social Choice Methods for Database Aggregation

  title={Social Choice Methods for Database Aggregation},
  author={F. Belardinelli and Umberto Grandi},
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… Expand


Computational Social Choice Meets Databases
A novel framework is developed that enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. Expand
A Social Choice Theoretic Perspective on Database Aggregation
Social welfare functions, the cornerstone problem in social choice theory, can be viewed as mechanisms to merge conflicting information, namely the individual preferences of voters expressed in the form of linear orders over a set of alternatives. Expand
Merging Databases Under Constraints
A formal semantics for this operation of merging first-order theories is proposed and it is shown that it has desirable properties, including abiding by majority rule in case of conflict and syntax independence. Expand
How to Define Certain Answers
This work combines three previously used approaches, based on the semantics and representation systems, on ordering incomplete databases in terms of their informativeness, and on viewing databases as knowledge expressed in a logical language, to come up with an alternative framework for defining certain answers. Expand
Optimal implementation of conjunctive queries in relational data bases
It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal. Expand
Distance semantics for database repair
A uniform way of representing repairs and their semantics clarifies the essence behind several approaches to consistency restoration in database systems, helps to compare the underlying formalisms, and relates them to existing methods of defining belief revision operators, merging data sets, and integrating information systems. Expand
DA2 merging operators
A new framework for propositional merging is presented and it is shown that (under very weak assumptions) query entailment from merged bases is "only" at the first level of the polynomial hierarchy when any of the DA2 operators is used. Expand
On the foundations of the universal relation model
The universal relation model aims at achieving complete access-path independence in relational databases by relieving the user of the need for logical navigation among relations. We clarify theExpand
Ontology merging as social choice: judgment aggregation under the open world assumption
The problem of merging several ontologies has important applications in the Semantic Web, medical ontology engineering, and other domains where information from several distinct sources needs to beExpand
Graph aggregation
A powerful impossibility theorem is generalised that generalises Arrow’s seminal result for the aggregation of preference orders to a large collection of different types of graphs. Expand