Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

DOI10.1007/978-3-030-00111-7_4MaRDI QIDQ6488078zbMATH OpenWikidataFDO

Authors Marcel Gehrke, Tanya Braun, Ralf Möller

Publication date 24 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-00111-7_4

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Lifted Dynamic Junction Tree Algorithm
• Preventing groundings and handling evidence in the lifted junction tree algorithm
• Counting and conjunctive queries in the lifted junction tree algorithm
• Fusing First-Order Knowledge Compilation and the Lifted Junction Tree Algorithm
• Lifted variable elimination: decoupling the operators from the constraint language

Cited in

(6)

• Counting and conjunctive queries in the lifted junction tree algorithm
• Taming reasoning in temporal probabilistic relational models
• Preventing groundings and handling evidence in the lifted junction tree algorithm
• Lifted Dynamic Junction Tree Algorithm
• Lifted temporal most probable explanation
• On the completeness and complexity of lifted temporal inference

This page was built for publication: Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

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