The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries
Summary: Extends the Shapley-value dichotomy to conjunctive queries with negated atoms, characterizing exact complexity. Shows negation fundamentally changes approximability—reduces approximation to the tuple-relevance decision, yielding new hardness and only limited randomized-approximation cases. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alon Reshef (Technion)
- 2. Benny Kimelfeld (Technion)
- 3. Ester Livshits (Technion)
BibTeX Citation
@inproceedings{reshef_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387664},
doi = {10.1145/3375395.3387664},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Reshef, Alon and Kimelfeld, Benny and Livshits, Ester},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043596705 |
| 605 | The Complexity of Causality and Responsibility for Query Answers and non-Answers | 2011 | VLDB | 0.00015839628 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,700 | Aggregated Deletion Propagation for Counting Conjunctive Query Answers | 2021 | VLDB |
| 2 | 5,441 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD |
| 3 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 4 | 10,020 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS |
| 5 | 2,424 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD |
| 6 | 5,382 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS |
| 7 | 3,918 | From Shapley Value to Model Counting and Back | 2024 | PODS |
| 8 | 5,657 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS |
| 9 | 9,809 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS |
| 10 | 10,183 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS |