Compressing probabilistic Prolog programs

DOI10.1007/s10994-007-5030-xzbMath1470.68097OpenAlexW2148550253MaRDI QIDQ1009237

K. Revoredo, Hannu T. T. Toivonen, Luc De Raedt, Kristian Kersting, Angelika Kimmig

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5030-x

zbMATH Keywords

compressioninductive logic programmingtheory revisionstatistical relational learningbiological applicationsprobabilistic logicnetwork mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17) Systems biology, networks (92C42)

Related Items (4)

Exact stochastic constraint optimisation with applications in network analysis ⋮ Structure learning of probabilistic logic programs by searching the clause space ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ On the Efficient Execution of ProbLog Programs

Uses Software

• ProbLog

Cites Work

• Probabilistic Horn abduction and Bayesian networks
• Graph-Based Algorithms for Boolean Function Manipulation
• The Complexity of Enumeration and Reliability Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compressing probabilistic Prolog programs