Compacting Boolean formulae for inference in probabilistic logic programming
From MaRDI portal
Publication:3449226
Recommendations
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Variable Compression in ProbLog
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Preprocessing Boolean formulae for BDDs in a probabilistic context
- Compressing probabilistic Prolog programs
Cites work
- Dedicated tabling for a probabilistic setting
- Efficient top-down computation of queries under the well-founded semantics
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 176871 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- On the implementation of the probabilistic logic programming language ProbLog
- Preprocessing Boolean formulae for BDDs in a probabilistic context
- Theory and Applications of Satisfiability Testing
- Variable Compression in ProbLog
Cited in
(5)- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Inference engine based on closure and join operators over truth table binary relations
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Preprocessing Boolean formulae for BDDs in a probabilistic context
- Efficient Knowledge Compilation Beyond Weighted Model Counting
This page was built for publication: Compacting Boolean formulae for inference in probabilistic logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449226)
