Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming. - Timothy van Bremen; Anton Dries; Jean Christoph Jung (CIKM, 2019)

Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry. - Timothy van Bremen; Ondrej Kuzelka (IJCAI, 2020)

onto2problog: A Probabilistic Ontology-Mediated Querying System using Probabilistic Logic Programming. - Timothy van Bremen; Anton Dries; Jean Christoph Jung (Künstliche Intell., 2020)

Symmetric Component Caching for Model Counting on Combinatorial Instances. - Timothy van Bremen; Vincent Derkinderen; Shubham Sharma 003; Subhajit Roy 001; Kuldeep S. Meel (AAAI, 2021)

Fast Algorithms for Relational Marginal Polytopes. - Yuanhong Wang; Timothy van Bremen; Juhua Pu; Yuyi Wang 001; Ondrej Kuzelka (IJCAI, 2021)

Automatic Conjecturing of P-Recursions Using Lifted Inference. - Jáchym Barvínek; Timothy van Bremen; Yuyi Wang 001; Filip Zelezný; Ondrej Kuzelka (ILP, 2021)

Faster lifting for two-variable logic using cell graphs. - Timothy van Bremen; Ondrej Kuzelka (UAI, 2021)

Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions. - Yuanhong Wang; Timothy van Bremen; Yuyi Wang 001; Ondrej Kuzelka (AAAI, 2022)

Probabilistic Query Evaluation: The Combined FPRAS Landscape. - Timothy van Bremen; Kuldeep S. Meel (PODS, 2023)

Lifted inference with tree axioms. - Timothy van Bremen; Ondrej Kuzelka (Artif. Intell., 2023)

Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. - Antoine Amarilli; Timothy van Bremen; Kuldeep S. Meel (ICDT, 2024)