Compacting Boolean Formulae for Inference in Probabilistic Logic Programming

DOI10.1007/978-3-319-23264-5_35zbMath1467.68026OpenAlexW2403763945MaRDI QIDQ3449226

Gerda Janssens, Dimitar Shterionov, Theofrastos Mantadelis

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/500398

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dedicated tabling for a probabilistic setting
• On the implementation of the probabilistic logic programming language ProbLog
• Efficient top-down computation of queries under the well-founded semantics
• Graph-Based Algorithms for Boolean Function Manipulation
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Preprocessing Boolean Formulae for BDDs in a Probabilistic Context
• Variable Compression in ProbLog
• Theory and Applications of Satisfiability Testing