default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy van Bremen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel:
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. ICDT 2024: 15:1-15:20- 2023
- [j2]Timothy van Bremen, Ondrej Kuzelka:
Lifted inference with tree axioms. Artif. Intell. 324: 103997 (2023) - [c9]Timothy van Bremen
, Kuldeep S. Meel:
Probabilistic Query Evaluation: The Combined FPRAS Landscape. PODS 2023: 339-347 - [i2]Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel:
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. CoRR abs/2309.13287 (2023) - 2022
- [c8]Yuanhong Wang, Timothy van Bremen, Yuyi Wang, Ondrej Kuzelka:
Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions. AAAI 2022: 10070-10079 - 2021
- [c7]Timothy van Bremen, Vincent Derkinderen, Shubham Sharma, Subhajit Roy, Kuldeep S. Meel:
Symmetric Component Caching for Model Counting on Combinatorial Instances. AAAI 2021: 3922-3930 - [c6]Yuanhong Wang, Timothy van Bremen, Juhua Pu, Yuyi Wang, Ondrej Kuzelka:
Fast Algorithms for Relational Marginal Polytopes. IJCAI 2021: 4266-4274 - [c5]Jáchym Barvínek, Timothy van Bremen, Yuyi Wang, Filip Zelezný, Ondrej Kuzelka:
Automatic Conjecturing of P-Recursions Using Lifted Inference. ILP 2021: 17-25 - [c4]Timothy van Bremen, Ondrej Kuzelka:
Lifted Inference with Tree Axioms. KR 2021: 599-608 - [c3]Timothy van Bremen, Ondrej Kuzelka:
Faster lifting for two-variable logic using cell graphs. UAI 2021: 1393-1402 - 2020
- [j1]Timothy van Bremen, Anton Dries, Jean Christoph Jung:
onto2problog: A Probabilistic Ontology-Mediated Querying System using Probabilistic Logic Programming. Künstliche Intell. 34(4): 501-507 (2020) - [c2]Timothy van Bremen, Ondrej Kuzelka:
Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry. IJCAI 2020: 4252-4258 - [i1]Timothy van Bremen, Ondrej Kuzelka:
Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry. CoRR abs/2001.05263 (2020)
2010 – 2019
- 2019
- [c1]Timothy van Bremen, Anton Dries, Jean Christoph Jung:
Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming. CIKM 2019: 2437-2440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
