# Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

arXiv: https://arxiv.org/abs/1807.00744 · HTML: https://mlsanity.com/paper/1807.00744/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Jul 2018.

## Built on by (most cited first, 1 of 1)

- [On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm](https://mlsanity.com/paper/2110.09197/) (2021)

## Abstract (arXiv)

The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a first-order cluster representation of a knowledge base for multiple queries and time steps. Unfortunately, a non-ideal elimination order can lead to groundings even though a lifted run is possible for a model. We extend LDJT (i) to identify unnecessary groundings while proceeding in time and (ii) to prevent groundings by delaying eliminations through changes in a temporal first-order cluster representation. The extended version of LDJT answers multiple temporal queries orders of magnitude faster than the original version.