SLIPCOVER

Structure LearnIng of Probabilistic logic programs by searChing OVER the clause space

SLIPCOVER learns the structures of Logic Programs with Annotated Disjunctions by searching first the clause space and then the theory space.

The refinements are scored by estimating the log likelihood of the data by running a small number of iterations of EMBLEM.

The algorithm is presented in the paper Structure Learning of Probabilistic Logic Programs by Searching the Clause Space by E. Bellodi and F. Riguzzi, accepted for publication in Theory and Practice of Logic Programming.

You can find a manual here: html, pdf.

SLIPCOVER is available in the cplint pack of SWI-Prolog, in source code on github and as a web application at http://cplint.ml.unife.it/

Bibliography
Elena Bellodi and Fabrizio Riguzzi. Structure learning of probabilistic logic programs by searching the clause space. Theory and Practice of Logic Programming, 15(2):169-212, © Cambridge University Press, 2015. [ bib | DOI | http | http ]