Database Paper Browser

Back to papers

Symmetric Weighted First-Order Model Counting

Summary: Studies symmetric WFOMC (uniform per-relation tuple weights) motivated by MLNs and KB inference; analyzes both data and combined complexity for FOMC/WFOMC. Shows data hardness: an FO3 formula with FOMC #P1-complete and a CQ with WFOMC #P1-complete, while gamma-acyclic queries are polynomial; combined complexity of FO^k (k≥2) is #P-complete. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1645
Venue
PODS
Year
2015
Pagerank
4.663547e-05
Overall Rank
7,739 | 46.17%
DOI
10.1145/2745754.2745760

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,683 Probabilistic Databases for All 2020 PODS 4.9638979e-05
7,539 A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries 2021 PODS 4.7166538e-05
7,601 Conjunctive Queries on Probabilistic Graphs: Combined Complexity 2017 PODS 4.698961e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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