Lifted Dynamic Junction Tree Algorithm (Q5878815)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7656416

Language	Label	Description	Also known as
English	Lifted Dynamic Junction Tree Algorithm	scientific article; zbMATH DE number 7656416

Statements

scholarly article

0 references

Lifted Dynamic Junction Tree Algorithm (English)

0 references

Graph-Based Representation and Reasoning

0 references

publication date

23 February 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-91379-7_5

0 references

Exploiting symmetries for scaling loopy belief propagation and relational training

0 references

Counting and conjunctive queries in the lifted junction tree algorithm

0 references

Modeling and Reasoning with Bayesian Networks

0 references

0 references

Markov logic networks

0 references

Lifted Variable Elimination: Decoupling the Operators from the Constraint Language

0 references

Stochastic relational processes: efficient inference and applications

0 references

\(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs

0 references

Identifiers

10.1007/978-3-319-91379-7_5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5878815

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5878815&oldid=37490416"