Publications (see also dblp)
Conferences and Journals:
-
Approximating Queries on Probabilistic Graphs (arXiv)
Antoine Amarilli*, Timothy van Bremen*, Octave Gaspard*, and Kuldeep S. Meel*
Journal version accepted to Logical Methods in Computer Science in 2025
Preliminary version appeared at International Conference on Database Theory (ICDT) 2024 -
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability (pdf, arXiv, doi, slides)
Antoine Amarilli*, Timothy van Bremen*, and Kuldeep S. Meel*
International Conference on Database Theory (ICDT) 2024
Selected as one of the 7 best papers from the conference; invited to a special issue of Logical Methods in Computer Science -
Probabilistic Query Evaluation: The Combined FPRAS Landscape (pdf, doi)
Timothy van Bremen* and Kuldeep S. Meel*
ACM Symposium on Principles of Database Systems (PODS) 2023
-
Lifted Inference with Tree Axioms (pdf, doi)
Timothy van Bremen and Ondřej Kuželka
Artificial Intelligence (AIJ) 2023
(Journal version of the KR 2021 paper) -
Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions (doi)
Yuanhong Wang, Timothy van Bremen, Yuyi Wang, and Ondřej Kuželka
AAAI Conference on Artificial Intelligence (AAAI) 2022 -
Automatic Conjecturing of P-Recursions Using Lifted Inference (pdf, doi)
Jáchym Barvínek, Timothy van Bremen, Yuyi Wang, Filip Železný, and Ondřej Kuželka
International Conference on Inductive Logic Programming (ILP) 2021 -
Lifted Inference with Tree Axioms (doi)
Timothy van Bremen and Ondřej Kuželka
International Conference on Principles of Knowledge Representation and Reasoning (KR) 2021
Runner-up for the Marco Cadoli Best Student Paper Award -
Faster Lifting for Two-Variable Logic Using Cell Graphs (url)
Timothy van Bremen and Ondřej Kuželka
Conference on Uncertainty in Artificial Intelligence (UAI) 2021 -
Symmetric Component Caching for Model Counting on Combinatorial Instances (doi)
Timothy van Bremen*, Vincent Derkinderen*, Shubham Sharma*, Subhajit Roy, and Kuldeep S. Meel
AAAI Conference on Artificial Intelligence (AAAI) 2021 -
Fast Algorithms for Relational Marginal Polytopes (doi)
Yuanhong Wang, Timothy van Bremen, Yuyi Wang, Juhua Pu, and Ondřej Kuželka
International Joint Conference on Artificial Intelligence (IJCAI) 2021 -
From Probabilistic NetKAT to ProbLog: New Algorithms for Inference and Learning in Probabilistic Networks (pdf)
Birthe van den Berg*, Timothy van Bremen*, Vincent Derkinderen*, Angelika Kimmig, Tom Schrijvers, and Luc De Raedt
International Conference on Probabilistic Programming (PROBPROG) 2021 -
onto2problog: A Probabilistic Ontology-mediated Querying System using Probabilistic Logic Programming (doi)
Timothy van Bremen*, Anton Dries*, and Jean Christoph Jung*
KI - Künstliche Intelligenz (German Journal of Artificial Intelligence) 2020
(This is a "systems description" version of the CIKM 2019 paper) -
Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry (doi)
Timothy van Bremen and Ondřej Kuželka
International Joint Conference on Artificial Intelligence (IJCAI) 2020 -
Ontology-mediated Queries over Probabilistic Data via Probabilistic Logic Programming (pdf, doi)
Timothy van Bremen*, Anton Dries*, and Jean Christoph Jung*
ACM International Conference on Information and Knowledge Management (CIKM) 2019 -
Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry (arXiv)
Timothy van Bremen and Ondřej Kuželka
International Workshop on Statistical Relational AI (StarAI) at AAAI 2020
(Preliminary version of a paper later published at IJCAI 2020) -
Efficient Cardinality Constraints in ProbLog
Timothy van Bremen, Wannes Meert, and Luc De Raedt
Benelux Conference on Artificial Intelligence (BNAIC) 2018 -
FastWFOMC
A tool for computing the weighted first-order model count of a two-variable sentence in a domain-lifted way. -
onto2problog
A tool for ontology-mediated query answering over probabilistic data for ontologies formulated in OWL 2 EL. -
SymGANAK
A probabilistic exact model counter with support for symmetric component caching.
Peer-reviewed workshops and domestic conferences: (show)
(* = alphabetical order or equal contribution)
Where possible, I try to keep the PDF versions of papers linked above up-to-date with corrections to any errors appearing in the published version.