Dan Suciu
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Compiling FO Sentences to Circuits: Upper Bounds and Lower Bounds on the Size of the Circuit | Probabilistic Circuits and Logic 2023 | 2023-10-16 |
Proves a concrete dichotomy: for universally quantified positive FO sentences the optimal OBDDs size is either polynomial in domain size n or exponential… | ||
| Algebraic Structures in Logic and Query Evaluation 3 | Logic and Algorithms in Database Theory and AI Boot Camp | 2023-08-21 |
Extends Datalog from sets to partially ordered pre-semirings and shows how monotone rules map to a semiring semantics via the immediate consequence operator… | ||
| Algebraic Structures in Logic and Query Evaluation 4 | Logic and Algorithms in Database Theory and AI Boot Camp | 2023-08-21 |
Explains that datalog evaluation over semirings reduces to grounded systems of polynomial equations whose solutions are provenance power series, shows simple… | ||
| Brief Tutorial on Probabilistic Databases | Uncertainty in Computation 2016 | 2016-10-04 |
Defines a tuple-independent model where each tuple is a random event and query probability equals the probability of the lineage (grounded FO sentence) and… | ||
| nothing matches | ||