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)
Incoming Non-self Citations Over Time
Authors
- 1. Paul Beame (University of Washington)
- 2. Guy Van den Broeck (Katholieke Universiteit Leuven)
- 3. Eric Gribkoff (University of Washington)
- 4. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{beame_pods15,
address = {New York, NY, USA},
series = {{PODS} '15},
title = {{Symmetric Weighted First-Order Model Counting}},
url = {https://dl.acm.org/doi/10.1145/2745754.2745760},
doi = {10.1145/2745754.2745760},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Beame, Paul and Van den Broeck, Guy and Gribkoff, Eric and Suciu, Dan},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,741 | Probabilistic Databases for All | 2020 | PODS | 5.7866368e-05 |
| 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 5.5638493e-05 |
| 7,851 | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries | 2021 | PODS | 5.531589e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 908 | Probase: A Probabilistic Taxonomy for Text Understanding | 2012 | SIGMOD | 0.00013300624 |
| 1,043 | Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS | 2011 | VLDB | 0.0001244565 |
| 3,952 | Towards High-Throughput Gibbs Sampling at Scale: A Study across Storage Managers | 2013 | SIGMOD | 6.9967272e-05 |
| 4,680 | Probabilistic Databases with MarkoViews | 2012 | VLDB | 6.5675814e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 2 | 13,956 | Knowledge compilation = Query rewriting + View synthesis | 2002 | PODS |
| 3 | 9,865 | Containment of Conjunctive Object Meta-Queries | 2006 | VLDB |
| 4 | 11,522 | On the Parameterized Complexity of Learning First-Order Logic | 2022 | PODS |
| 5 | 11,969 | Dichotomies in Ontology-Mediated Querying with the Guarded Fragment | 2017 | PODS |
| 6 | 5,657 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS |
| 7 | 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS |
| 8 | 3,918 | From Shapley Value to Model Counting and Back | 2024 | PODS |
| 9 | 7,851 | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries | 2021 | PODS |
| 10 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |