{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/expected-shapley-like-scores-of-boolean","title":"Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases","arxiv_id":"2401.06493","date":"2024-01-12","proceeding":null,"authors":["Pratik Karmakar","Mikaël Monet","Pierre Senellart","Stéphane Bressan"],"abstract":"Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, along with other similar power indices such as Banzhaf values. In this work we adapt these Shapley-like scores to probabilistic settings, the objective being to compute their expected value. We show that the computations of expected Shapley values and of the expected values of Boolean functions are interreducible in polynomial time, thus obtaining the same tractability landscape. We investigate the specific tractable case where Boolean functions are represented as deterministic decomposable circuits, designing a polynomial-time algorithm for this setting. We present applications to probabilistic databases through database provenance, and an effective implementation of this algorithm within the ProvSQL system, which experimentally validates its feasibility over a standard benchmark.","url_abs":"https://arxiv.org/abs/2401.06493v2","url_pdf":"https://arxiv.org/pdf/2401.06493v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"expected-shapley-like-scores-of-boolean","repo_url":"https://github.com/pierresenellart/provsql","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2401.06493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06493"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pierresenellart/provsql","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"named_in_paper":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"e649afb50f545dbd","entry":"convert","repo":"pierresenellart/provsql","repo_kind":"named_in_paper","path":"studio/web/build-casestudies.py","file_url":"https://github.com/pierresenellart/provsql/blob/HEAD/studio/web/build-casestudies.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e649afb50f545dbd"}},{"code_sha256_prefix":"765961cfa686817b","entry":"split_statements","repo":"pierresenellart/provsql","repo_kind":"named_in_paper","path":"studio/web/build-casestudies.py","file_url":"https://github.com/pierresenellart/provsql/blob/HEAD/studio/web/build-casestudies.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"765961cfa686817b"}},{"code_sha256_prefix":"e084d1f77fb4a27a","entry":"validate_panel_option","repo":"pierresenellart/provsql","repo_kind":"named_in_paper","path":"studio/provsql_studio/db.py","file_url":"https://github.com/pierresenellart/provsql/blob/HEAD/studio/provsql_studio/db.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e084d1f77fb4a27a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}