2 citations · 4 across the 20 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.AI2018
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…
cs.AI2018
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…
cs.AI2018
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…