\(k\)-optimal: a novel approximate inference algorithm for ProbLog

DOI10.1007/s10994-012-5304-9zbMath1260.68067OpenAlexW2030537165MaRDI QIDQ1945136

Guy Van den Broeck, Joris Renkens, 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

decision theoryinductive logic programmingstatistical relational learningapproximative inference

Mathematics Subject Classification ID

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

Related Items

\(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs, Probabilistic (logic) programming concepts, An OpenCL implementation of a forward sampling algorithm for CP-logic, ProbLog

Uses Software

• SPINE

Cites Work

• On the complexity of approximating \(k\)-set packing
• Probabilistic Inductive Querying Using ProbLog
• Graph-Based Algorithms for Boolean Function Manipulation