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)
Incoming Non-self Citations Over Time
Authors
- 1. Pratik Karmakar
- 2. Mikaël Monet
- 3. Pierre Senellart
- 4. Stéphane Bressan
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,663 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB | 4.4676883e-05 |
| 9,639 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS | 4.3067693e-05 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1905499e-05 |
| 10,403 | Shapley Value Estimation Based on Differential Matrix | 2025 | SIGMOD | 4.1905499e-05 |
| 10,533 | Understanding the Black Box: A Deep Empirical Dive into Shapley Value Approximations for Tabular Data | 2025 | SIGMOD | 4.1905499e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,259 | ProvSQL: Provenance and Probability Management in PostgreSQL | 2018 | VLDB | 9.1790333e-05 |
| 2,876 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 7.9739469e-05 |
| 3,030 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS | 7.676832e-05 |
| 4,591 | From Shapley Value to Model Counting and Back | 2024 | PODS | 6.056109e-05 |
| 5,918 | Banzhaf Values for Facts in Query Answering | 2024 | SIGMOD | 5.2688869e-05 |
| 6,058 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS | 5.2274142e-05 |
| 7,151 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8127652e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,439 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS | 6.1806955e-05 |
| 6,058 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS | 5.2274142e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
| 9,639 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS | 4.3067693e-05 |
| 3,030 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS | 7.676832e-05 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1905499e-05 |
| 4,591 | From Shapley Value to Model Counting and Back | 2024 | PODS | 6.056109e-05 |
| 2,876 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 7.9739469e-05 |