On the completeness and complexity of lifted temporal inference

DOI10.1007/978-3-031-76235-2_14MaRDI QIDQ6979922zbMATH OpenFDO

Authors Marcel Gehrke

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-76235-2_14

zbMATH Keywords

completenesscomplexitytemporal relational inference

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites work

• Exploiting symmetries for scaling loopy belief propagation and relational training
• KI 2016: advances in artificial intelligence. 39th annual German conference on AI, Klagenfurt, Austria, September 26--30, 2016. Proceedings
• Lifted Dynamic Junction Tree Algorithm
• Lifted inference with tree axioms
• Modeling and Reasoning with Bayesian Networks
• PETS: predicting efficiently using temporal symmetries in temporal PGMs
• Preventing groundings and handling evidence in the lifted junction tree algorithm
• Taming reasoning in temporal probabilistic relational models
• Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

This page was built for publication: On the completeness and complexity of lifted temporal inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979922)