Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal is to attribute to individual tuples a level of responsibility to the overall inconsistency, and thereby prioritize tuples in the explanation or inspection of dirt. Therefore, inconsistency quantification and attribution have been a subject of much research in Knowledge Representation and, more recently, in Databases. As in many other fields, a conventional responsibility sharing mechanism is the Shapley value from cooperative game theory. In this paper, we carry out a systematic investigation of the complexity of the Shapley value in common inconsistency measures for functional-dependency (FD) violations. For several measures we establish a full classification of the FD sets into tractable and intractable classes with respect to Shapley-value computation. We also study the complexity of approximation in intractable cases.
@InProceedings{livshits_et_al:LIPIcs.ICDT.2021.15, author = {Livshits, Ester and Kimelfeld, Benny}, title = {{The Shapley Value of Inconsistency Measures for Functional Dependencies}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {15:1--15:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.15}, URN = {urn:nbn:de:0030-drops-137230}, doi = {10.4230/LIPIcs.ICDT.2021.15}, annote = {Keywords: Shapley value, inconsistent databases, functional dependencies, database repairs} }
Feedback for Dagstuhl Publishing