T_P-compilation for inference in probabilistic logic programs
From MaRDI portal
Publication:324656
Recommendations
- The magic of logical inference in probabilistic programming
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
- Constraint-based inference in probabilistic logic programs
- Compacting Boolean formulae for inference in probabilistic logic programming
Cites work
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 49478 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 898233 (Why is no real title available?)
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Compiling probabilistic graphical models using sentential decision diagrams
- Compiling relational Bayesian networks for exact inference
- Exploiting local and repeated structure in dynamic Bayesian networks
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Knowledge compilation of logic programs using approximation fixpoint theory
- Logic Programming
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Modeling and Reasoning with Bayesian Networks
- On probabilistic inference by weighted model counting
- Planning in hybrid relational MDPs
- Probabilistic (logic) programming concepts
- Probabilistic databases
- Probabilistic inductive logic programming. Theory and applications
- Probabilistic logic programming for hybrid relational domains
- Revising Probabilistic Prolog Programs
- Stochastic relational processes: efficient inference and applications
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- The distribution semantics for normal programs with function symbols
- The magic of logical inference in probabilistic programming
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- \(k\)-optimal: a novel approximate inference algorithm for ProbLog
Cited in
(15)- Aspmc: new frontiers of algebraic answer set counting
- The magic of logical inference in probabilistic programming
- Semirings for probabilistic and neuro-symbolic logic programming
- Lifted Dynamic Junction Tree Algorithm
- Compacting Boolean formulae for inference in probabilistic logic programming
- The distribution semantics for normal programs with function symbols
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Logical Compilation of Bayesian Networks with Discrete Variables
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
- Enhancing SMT-based weighted model integration by structure awareness
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- Challenges of real-world reinforcement learning: definitions, benchmarks and analysis
- Sampling-based SAT/ASP multi-model optimization as a framework for probabilistic inference
- kProbLog: an algebraic Prolog for machine learning
- kProbLog: an algebraic Prolog for kernel programming
This page was built for publication: \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324656)
