T_P-compilation for inference in probabilistic logic programs
From MaRDI portal
Publication:324656
DOI10.1016/J.IJAR.2016.06.009zbMATH Open1386.68174OpenAlexW2465254145MaRDI QIDQ324656FDOQ324656
Angelika Kimmig, Wannes Meert, Jonas Vlasselaer, Guy Van den Broeck, Luc De Raedt
Publication date: 17 October 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.06.009
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-optimal: a novel approximate inference algorithm for ProbLog
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Modeling and Reasoning with Bayesian Networks
- On probabilistic inference by weighted model counting
- Probabilistic inductive logic programming. Theory and applications
- The distribution semantics for normal programs with function symbols
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Logic Programming
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Probabilistic (logic) programming concepts
- Planning in hybrid relational MDPs
- Compiling relational Bayesian networks for exact inference
- Probabilistic logic programming for hybrid relational domains
- Exploiting local and repeated structure in dynamic Bayesian networks
- The magic of logical inference in probabilistic programming
- Probabilistic Databases
- $$\#\exists $$ SAT: Projected Model Counting
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Stochastic relational processes: efficient inference and applications
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Knowledge compilation of logic programs using approximation fixpoint theory
- Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams
- Revising Probabilistic Prolog Programs
Cited In (9)
- Aspmc: new frontiers of algebraic answer set counting
- Semirings for probabilistic and neuro-symbolic logic programming
- kProbLog: An Algebraic Prolog for Kernel Programming
- Lifted Dynamic Junction Tree Algorithm
- The distribution semantics for normal programs with function symbols
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Challenges of real-world reinforcement learning: definitions, benchmarks and analysis
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- kProbLog: an algebraic Prolog for machine learning
Uses Software
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)
