2 citations · 3 across the 3 of their papers we have counts for
6 papers
Lifting DecPOMDPs for Nanoscale Systems -- A Work in Progress
Tanya Braun, Stefan Fischer, Florian Lau +1
DNA-based nanonetworks have a wide range of promising use cases, especially in the field of medicine. With a large set of agents, a partially observable stochastic environment, and…
Exploring Unknown Universes in Probabilistic Relational Models
Tanya Braun, Ralf Möller
Large probabilistic models are often shaped by a pool of known individuals (a universe) and relations between them. Lifted inference algorithms handle sets of known individuals for…
Taming Reasoning in Temporal Probabilistic Relational Models
Marcel Gehrke, Ralf Möller, Tanya Braun
Evidence often grounds temporal probabilistic relational models over time, which makes reasoning infeasible. To counteract groundings over time and to keep reasoning polynomial by…
Answering Hindsight Queries with Lifted Dynamic Junction Trees
Marcel Gehrke, Tanya Braun, Ralf Möller
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a f…
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm
Marcel Gehrke, Tanya Braun, Ralf Möller
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a f…
Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm
Tanya Braun, Ralf Möller
Standard approaches for inference in probabilistic formalisms with first-order constructs include lifted variable elimination (LVE) for single queries as well as first-order knowle…