Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases
Summary: Provide a polynomial-time construction of deterministic decomposable circuits for a class of UCQs previously conjectured to separate extensional (inclusion–exclusion) and intensional approaches. Show inclusion–exclusion can be avoided via negation, proving intensional compilation suffices for this case. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,868 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 7.9816425e-05 |
| 5,959 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 5.2562342e-05 |
| 6,683 | Probabilistic Databases for All | 2020 | PODS | 4.9638979e-05 |
| 9,653 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS | 4.3109001e-05 |
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 |
|---|---|---|---|---|
| 2,256 | ProvSQL: Provenance and Probability Management in PostgreSQL | 2018 | VLDB | 9.1879032e-05 |
| 5,638 | Circuit Treewidth, Sentential Decision, and Query Compilation | 2017 | PODS | 5.3965476e-05 |
Previous
Page 1 / 1
Next