Compressing probabilistic Prolog programs

DOI10.1007/S10994-007-5030-XMaRDI QIDQ1009237zbMATH OpenOpenAlexFDO

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

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

compressionstatistical relational learninginductive logic programmingbiological applicationsprobabilistic logictheory revisionnetwork mining

Mathematics Subject Classification ID

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

Recommendations

• On the Efficient Execution of ProbLog Programs
• Variable Compression in ProbLog
• Revising Probabilistic Prolog Programs
• On the implementation of the probabilistic logic programming language ProbLog
• Probabilistic inductive querying using \texttt{ProbLog}

Cites work

• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• scientific article; zbMATH DE number 710106 (Why is no real title available?)
• scientific article; zbMATH DE number 1149434 (Why is no real title available?)
• scientific article; zbMATH DE number 1531966 (Why is no real title available?)
• scientific article; zbMATH DE number 1753155 (Why is no real title available?)
• scientific article; zbMATH DE number 970710 (Why is no real title available?)
• Graph-Based Algorithms for Boolean Function Manipulation
• Probabilistic Horn abduction and Bayesian networks
• The Complexity of Enumeration and Reliability Problems

Cited in

(10)

• Exact stochastic constraint optimisation with applications in network analysis
• Variable Compression in ProbLog
• Compacting Boolean formulae for inference in probabilistic logic programming
• On the Efficient Execution of ProbLog Programs
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Revising Probabilistic Prolog Programs
• Probabilistic inductive querying using \texttt{ProbLog}
• Syntactic partial order compression for probabilistic reachability
• Structure learning of probabilistic logic programs by searching the clause space
• k-optimal: a novel approximate inference algorithm for ProbLog

Describes a project that uses

Uses Software

• ProbLog

This page was built for publication: Compressing probabilistic Prolog programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009237)