2 papers
cs.DB2023
Approximating Queries on Probabilistic Graphs
Antoine Amarilli, Timothy van Bremen, Octave Gaspard +1
Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of appro…
cs.AI2020
Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry
Timothy van Bremen, Ondrej Kuzelka
We study the symmetric weighted first-order model counting task and present ApproxWFOMC, a novel anytime method for efficiently bounding the weighted first-order model count in the…