Database Paper Browser

Back to papers

A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries

Summary: Strengthens the dichotomy for generalized model counting on UCQs by showing every unsafe UCQ is #P-hard even when tuple probabilities are restricted to {0,1/2,1}, using novel hardness techniques. Also proves that model counting with probabilities in {0,1/2} is #P-hard for Type‑I forbidden queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1808
Venue
PODS
Year
2021
Pagerank
4.7166538e-05
Overall Rank
7,539 | 47.56%
DOI
10.1145/3452021.3458313

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,055 When is Shapley Value Computation a Matter of Counting? 2024 PODS 5.2324399e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
7,739 Symmetric Weighted First-Order Model Counting 2015 PODS 4.663547e-05
Previous Page 1 / 1 Next

Semantically Similar Papers