The Shapley Value of Inconsistency Measures for Functional Dependencies

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 tuple...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 18, Issue 2
Main Authors: Livshits, Ester, Kimelfeld, Benny
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 15.06.2022
Subjects:
computer science - databases
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
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.
Author Kimelfeld, Benny
Livshits, Ester
Author_xml – sequence: 1
  givenname: Ester
  surname: Livshits
  fullname: Livshits, Ester
– sequence: 2
  givenname: Benny
  surname: Kimelfeld
  fullname: Kimelfeld, Benny
BookMark eNpNkEFPAjEQhRuDiYj8AU971MNqO2V3u94MCpJgPIhem2l3KkuWlrRw4N8LaIxzeZOXl-_wXbKeD54Yuxb8blRCre67tU25UDfwAPwWOMAZ6wtV8ryoq1Hv33_Bhimt-OGkFArKPpsulpS9L3HT0T77xG5HWXDZzNvgU5u25O0-eyVMu0gpcyFmk5232zZ47LIn2pBvDpOW0hU7d9glGv7mgH1Mnhfjl3z-Np2NH-e5BZCQVw5rwyvLi1oJp6yrsSkarrgCZcpCIlXSgkXZWOfqgpzkBo2CmoxBIa0csNkPtwm40pvYrjHudcBWn4oQvzTGbWs70k6VioumLI2EkTBkGsSGqoKDLNzIygMLflg2hpQiuT-e4PpkVh_NaqE0aOD6aFZ-AzJHb4w
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-18(2:20)2022
DatabaseName CrossRef
Open Access: DOAJ - Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Open Access: DOAJ - Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_f86801d66b3241bebdaade750235f4c3
10_46298_lmcs_18_2_20_2022
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c2232-7fa9b07c05981f8cf9ad5d080828b653ae73c2ca3dcff95ef30bab829ebba13c3
IEDL.DBID DOA
ISSN 1860-5974
IngestDate Fri Oct 03 12:52:41 EDT 2025
Sat Nov 29 06:21:51 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2232-7fa9b07c05981f8cf9ad5d080828b653ae73c2ca3dcff95ef30bab829ebba13c3
OpenAccessLink https://doaj.org/article/f86801d66b3241bebdaade750235f4c3
ParticipantIDs doaj_primary_oai_doaj_org_article_f86801d66b3241bebdaade750235f4c3
crossref_primary_10_46298_lmcs_18_2_20_2022
PublicationCentury 2000
PublicationDate 2022-06-15
PublicationDateYYYYMMDD 2022-06-15
PublicationDate_xml – month: 06
  year: 2022
  text: 2022-06-15
  day: 15
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2022
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.3328462
Snippet Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data...
Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - databases
Title The Shapley Value of Inconsistency Measures for Functional Dependencies
URI https://doaj.org/article/f86801d66b3241bebdaade750235f4c3
Volume 18, Issue 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Open Access: DOAJ - Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcDCG1Fe8sAAQlHjRxKbjUcLA62QgKqbZTu2QCpt1bRILPx2zkmKysTCkiFKLOcu5-_7rPMdQqcaMNnFNous9D7izrnISMcj4zkz0oCWK4s99x-yXk8MBvJxqdVXyAmrygNXhmt5kcIimqepAegn8HKude4A5yhLPLdlnU9gPUtiqlyDGQvEuTolw1MqRWv4bouIiDN6SeNzkPz0FxItFewvkaWzidZrSoivqqlsoRU32kYbi3YLuI6-HXQHLsVPr3oCcYz7ejh3eOwxBHjIcS0C9_3E3WrLr8DARXEHMKva6sO3da9bGKvYRS-d9vPNfVT3QYgsgDcQYK-liTMLTEgQL6yXOk9y-GhQSyZNmHYZs9RqllvvZeI8i402gkpnjCbMsj3UGI1Hbh_hhDtY3FKdZ8TyWIM7QCFKkeSEOyAfvIkuFjZRk6rchQKZUFpQBQsqIhRVNFbBgk10Hcz282QoVV3eAAeq2oHqLwce_Mcgh2gtTCjkcJHkCDVm07k7Rqv2Y_ZWTE_KfwOu3a_2NzyawN4
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Shapley+Value+of+Inconsistency+Measures+for+Functional+Dependencies&rft.jtitle=Logical+methods+in+computer+science&rft.au=Livshits%2C+Ester&rft.au=Kimelfeld%2C+Benny&rft.date=2022-06-15&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=18%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-18%282%3A20%292022&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_18_2_20_2022
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon