k-optimal: a novel approximate inference algorithm for ProbLog

DOI10.1007/S10994-012-5304-9MaRDI QIDQ1945136zbMATH OpenOpenAlexFDO

Authors Joris Renkens, Guy Van den Broeck, Siegfried Nijssen

Publication date 2 April 2013

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-012-5304-9

zbMATH Keywords

approximative inferencedecision theoryinductive logic programmingstatistical relational learning

Mathematics Subject Classification ID

Logic programming (68N17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Approximate Inference for Logic Programs with Annotated Disjunctions
• Extending ProbLog with Continuous Distributions
• Revising Probabilistic Prolog Programs
• MAP inference for probabilistic logic programming
• Compressing probabilistic Prolog programs

Cites work

• Graph-Based Algorithms for Boolean Function Manipulation
• On the complexity of approximating \(k\)-set packing
• Probabilistic inductive querying using \texttt{ProbLog}

Cited in

(8)

• kProbLog: an algebraic Prolog for machine learning
• ProbLog
• kProbLog: an algebraic Prolog for kernel programming
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• scientific article; zbMATH DE number 140393 (Why is no real title available?)
• Online inference based on approximate factors for probabilistic knowledge bases
• Probabilistic (logic) programming concepts
• An OpenCL implementation of a forward sampling algorithm for CP-logic

Describes a project that uses

Uses Software

• SPINE

This page was built for publication: \(k\)-optimal: a novel approximate inference algorithm for ProbLog

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