We use cookies to analyze our traffic. To do so, we also use third-party cookies that help us analyze how you use this website. These cookies will only be stored in your browser with your prior consent.
Necessary cookies are required to enable the basic features of this site. We do not use necessary cookies.
Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics such as the number of visitors, bounce rate, traffic source, etc.
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 ]