Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reconciling while tolerating disagreement in collaborative data sharing
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Consistent query answering in databases
ACM SIGMOD Record
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Database Systems (TODS)
FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Update exchange with mappings and provenance
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Believe it or not: adding belief annotations to databases
Proceedings of the VLDB Endowment
Cooperative update exchange in the Youtopia system
Proceedings of the VLDB Endowment
The semantics of consistency and trust in peer data exchange systems
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Automatic conflict resolution in a CDSS
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Collaborative data sharing via update exchange and provenance
ACM Transactions on Database Systems (TODS)
FusionDB: conflict management system for small-science databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, trust relationships often exist between users, allowing them to accept or reject other users' beliefs by default. As those trust relationships become complex, however, it becomes difficult to define and compute a consistent snapshot of the conflicting information. Previous solutions to a related problem, the update reconciliation problem, are dependent on the order in which the updates are processed and, therefore, do not guarantee a globally consistent snapshot. This paper proposes the first principled solution to the automatic conflict resolution problem in a community database. Our semantics is based on the certain tuples of all stable models of a logic program. While evaluating stable models in general is well known to be hard, even for very simple logic programs, we show that the conflict resolution problem admits a PTIME solution. To the best of our knowledge, ours is the first PTIME algorithm that allows conflict resolution in a principled way. We further discuss extensions to negative beliefs and prove that some of these extensions are hard. This work is done in the context of the BeliefDB project at the University of Washington, which focuses on the efficient management of conflicts in community databases.