EMBLEM

EM over Bdds for probabilistic Logic programs Efficient Mining

EMBLEM is an algorithm for learning the parameters of Logic Programs with Annotated Disjunctions. It applies EM and computes the expectations by traversing twice the BDDs that are built for inference.

You can find a manual here: html, pdf.

Bibliography
Elena Bellodi and Fabrizio Riguzzi. Expectation Maximization over binary decision diagrams for probabilistic logic programs. Intelligent Data Analysis, 17(2):343-363, © IOS Press, 2013. [ bib | DOI | http | .pdf ]

Elena Bellodi and Fabrizio Riguzzi. Experimentation of an expectation maximization algorithm for probabilistic logic programs. Intelligenza Artificiale, 8(1):3-18, © IOS Press, 2012. [ bib | DOI | .pdf ]