103 citations · 300 across the 45 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DB2019★ 5 cited
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs
Antoine Amarilli, İsmail İlkan Ceylan
We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two. We focus on the class of queries c…
cs.DB2019★ 6 cited
Uniform Reliability of Self-Join-Free Conjunctive Queries
Antoine Amarilli, Benny Kimelfeld
The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are…
cs.AI2019★ 2 cited
Smoothing Structured Decomposable Circuits
Andy Shih, Guy Van den Broeck, Paul Beame +1
We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art infe…