DBScholar

Back to papers

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases

Summary: Adapts Shapley-like scores to probabilistic databases; shows PTIME interreducibility with expected Boolean function values. PTIME algorithm for deterministic decomposable circuits; ProvSQL implements it, proving practicality on provenance tasks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1955
Venue
PODS
Year
2024
Pagerank
6.237788e-05
Overall Rank
5,382 | 63.08%
DOI
10.1145/3651593

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{karmakar_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases}},
        url = {https://dl.acm.org/doi/10.1145/3651593},
        doi = {10.1145/3651593},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Karmakar, Pratik and Monet, Mikaël and Senellart, Pierre and Bressan, Stéphane},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers