Lifted Dynamic Junction Tree Algorithm
From MaRDI portal
Publication:5878815
DOI10.1007/978-3-319-91379-7_5OpenAlexW2803638477WikidataQ64363085 ScholiaQ64363085MaRDI QIDQ5878815
No author found.
Publication date: 23 February 2023
Published in: Graph-Based Representation and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-91379-7_5
Cites Work
- Unnamed Item
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Stochastic relational processes: efficient inference and applications
- Counting and conjunctive queries in the lifted junction tree algorithm
- Markov logic networks
- Lifted Variable Elimination: Decoupling the Operators from the Constraint Language
- Modeling and Reasoning with Bayesian Networks
This page was built for publication: Lifted Dynamic Junction Tree Algorithm