{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:52:14Z","timestamp":1773939134092,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["804302"],"award-info":[{"award-number":["804302"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German Research Foundation","award":["412400621"],"award-info":[{"award-number":["412400621"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["768\/19"],"award-info":[{"award-number":["768\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517912","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"1570-1583","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Computing the Shapley Value of Facts in Query Answering"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Deutch","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nave","family":"Frost","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mika\u00ebl","family":"Monet","sequence":"additional","affiliation":[{"name":"Univ. Lille, Inria, CNRS, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Vol. 8. Addison-Wesley Reading. http:\/\/webdam.inria.fr\/Alice\/"},{"key":"e_1_3_2_1_2_1","volume-title":"2021 a. On the complexity of SHAP-score-based explanations: Tractability via knowledge compilation and non-approximability results. arXiv preprint","author":"Arenas Marcelo","year":"2021","unstructured":"Marcelo Arenas, Pablo Barcel\u00f3, Leopoldo Bertossi, and Mika\u00ebl Monet. 2021 a. On the complexity of SHAP-score-based explanations: Tractability via knowledge compilation and non-approximability results. arXiv preprint (2021). https:\/\/arxiv.org\/abs\/2104.08015"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16825"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376918"},{"key":"e_1_3_2_1_5_1","volume-title":"Why and where: A characterization of data provenance","author":"Buneman Peter","unstructured":"Peter Buneman, Sanjeev Khanna, and Tan Wang-Chiew. 2001. Why and where: A characterization of data provenance. In ICDT. Springer, 316--330. https:\/\/repository.upenn.edu\/cgi\/viewcontent.cgi?article=1209&context=cis_papers"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/357775.357777"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395119"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.11.11-34"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of ECAI. Citeseer, 328--332","author":"Darwiche Adnan","year":"2004","unstructured":"Adnan Darwiche. 2004. New advances in compiling CNF to decomposable negation normal form. In Proceedings of ECAI. Citeseer, 328--332. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.178.2262"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.989"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00584-7"},{"key":"e_1_3_2_1_13_1","unstructured":"Daniel Deutch Nave Frost Benny Kimelfeld and Mika\u00ebl Monet. 2021. Shapley for database facts source code. https:\/\/github.com\/navefr\/ShapleyForDbFacts ."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056125"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.06.001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9392-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"The Shapley value of tuples in query answering. In ICDT, Vol. 155","volume":"20","author":"Livshits Ester","year":"2020","unstructured":"Ester Livshits, Leopoldo E. Bertossi, Benny Kimelfeld, and Moshe Sebag. 2020. The Shapley value of tuples in query answering. In ICDT, Vol. 155. Schloss Dagstuhl, 20:1--20:19. https:\/\/arxiv.org\/abs\/1904.08679","journal-title":"Schloss Dagstuhl"},{"key":"e_1_3_2_1_21_1","volume-title":"From local explanations to global understanding with explainable AI for trees. Nature machine intelligence","author":"Lundberg Scott M","year":"2020","unstructured":"Scott M Lundberg, Gabriel Erion, Hugh Chen, Alex DeGrave, Jordan M Prutkin, Bala Nair, Ronit Katz, Jonathan Himmelfarb, Nisha Bansal, and Su-In Lee. 2020. From local explanations to global understanding with explainable AI for trees. Nature machine intelligence, Vol. 2, 1 (2020), 2522--5839. https:\/\/arxiv.org\/pdf\/1905.04610.pdf"},{"key":"e_1_3_2_1_22_1","unstructured":"Scott M Lundberg and Su-In Lee. 2017. A unified approach to interpreting model predictions. In Advances in neural information processing systems. 4765--4774. http:\/\/papers.nips.cc\/paper\/7062-a-unified-approach-to-interpreting-model-predictions.pdf"},{"key":"e_1_3_2_1_23_1","volume-title":"Values for large games, IV: Evaluating the Electoral College by Monte Carlo Techniques","author":"Mann Irwin","year":"1960","unstructured":"Irwin Mann and LS Shapley. 1960. Values for large games, IV: Evaluating the Electoral College by Monte Carlo Techniques. The Rand Corporation. Research Memorandum, Vol. 2651 (1960). https:\/\/www.rand.org\/pubs\/research_memoranda\/RM2651.html"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1880172.1880176"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733070"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387642"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387664"},{"key":"e_1_3_2_1_28_1","volume-title":"The Shapley Value: Essays in Honor of Lloyd S. Shapley","author":"Roth Alvin E","unstructured":"Alvin E Roth. 1988. The Shapley Value: Essays in Honor of Lloyd S. Shapley .Cambridge University Press. http:\/\/www.library.fa.ru\/files\/Roth2.pdf"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856329"},{"key":"e_1_3_2_1_30_1","volume-title":"Quantifying causal effects on query answering in databases","author":"Salimi Babak","unstructured":"Babak Salimi, Leopoldo E. Bertossi, Dan Suciu, and Guy Van den Broeck. 2016. Quantifying causal effects on query answering in databases. In TaPP. USENIX Association. http:\/\/web.cs.ucla.edu\/ guyvdb\/papers\/SalimiTaPP16.pdf"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236253"},{"key":"e_1_3_2_1_32_1","first-page":"39","volume-title":"A value for n-person games. Contributions to the Theory of Games","author":"Shapley Lloyd S","year":"1953","unstructured":"Lloyd S Shapley. 1953. A value for n-person games. Contributions to the Theory of Games, Vol. 2, 28 (1953), 307--317. http:\/\/www.library.fa.ru\/files\/Roth2.pdf#page=39"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Dan Suciu Dan Olteanu Christopher R\u00e9 and Christoph Koch. 2011. Probabilistic Databases .Morgan & Claypool. https:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00362ED1V01Y201105DTM016","DOI":"10.1007\/978-3-031-01879-4"},{"key":"e_1_3_2_1_34_1","unstructured":"Transaction Processing Performance Council (TPC). 2017. hrefhttp:\/\/www.tpc.org\/tpc_documents_current_versions\/pdf\/tpc-h_v2.17.2.pdfTPC-H benchmark. http:\/\/www.tpc.org\/tpc_documents_current_versions\/pdf\/tpc-h_v2.17.2.pdf"},{"key":"e_1_3_2_1_35_1","volume-title":"Automation of reasoning","author":"Tseitin Grigori S","year":"1955","unstructured":"Grigori S Tseitin. 1983. On the complexity of derivation in propositional calculus. In Automation of reasoning. Springer, 466--483. https:\/\/link.springer.com\/chapter\/10.1007\/978--3--642--81955--1_28"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i7.16806"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Moshe Y Vardi. 1982. The complexity of relational query languages. In STOC. ACM 137--146. http:\/\/www.dis.uniroma1.it\/ degiacom\/didattica\/semingsoft\/SIS05-06\/materiale\/1-query-congiuntive\/riferimenti\/vardi-1982.pdf","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_38_1","first-page":"6","article-title":"A theoretical analysis of NDCG ranking measures","volume":"8","author":"Wang Yining","year":"2013","unstructured":"Yining Wang, Liwei Wang, Yuanzhi Li, Di He, Wei Chen, and Tie-Yan Liu. 2013. A theoretical analysis of NDCG ranking measures. In Proceedings of COLT, Vol. 8. 6. https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.680.490&rep=rep1&type=pdf","journal-title":"Proceedings of COLT"},{"key":"e_1_3_2_1_39_1","volume-title":"IJCAI. ijcai.org","author":"Yun Bruno","year":"1977","unstructured":"Bruno Yun, Srdjan Vesic, Madalina Croitoru, and Pierre Bisquert. 2018. Inconsistency Measures for Repair Semantics in OBDA. In IJCAI. ijcai.org, 1977--1983. https:\/\/www.ijcai.org\/proceedings\/2018\/0273.pdf"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:06Z","timestamp":1750183806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":39,"alternative-id":["10.1145\/3514221.3517912","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517912","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}