On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

Marcel Gehrke

For static lifted inference algorithms, completeness, i.e., domain liftability, is extensively studied. However, so far no domain liftability results for temporal lifted inference…