A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
DOI10.1016/J.IJAR.2016.10.002zbMATH Open1400.68226OpenAlexW2531711132WikidataQ58063524 ScholiaQ58063524MaRDI QIDQ2374532FDOQ2374532
Authors: Fabrizio Riguzzi, Elena Bellodi, Riccardo Zese, Giuseppe Cota, Evelina Lamma 
Publication date: 15 December 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.10.002
Recommendations
- Lifted variable elimination for probabilistic logic programming
- Inference in probabilistic logic programs using lifted explanations
- Lifted discriminative learning of probabilistic logic programs
- Evaluating inference algorithms for the Prolog factor language
- Generalized counting for lifted variable elimination
distribution semanticsprobabilistic logic programmingProbLogvariable eliminationlifted inferencestatistical relational artificial intelligence
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- On probabilistic inference by weighted model counting
- Probabilistic inductive logic programming. Theory and applications
- Title not available (Why is that?)
- The independent choice logic for modelling multiple agents under uncertainty
- Probabilistic Horn abduction and Bayesian networks
- The distribution semantics for normal programs with function symbols
- A Survey of Fast Exponentiation Methods
- Logic Programming
- The Independent Choice Logic and Beyond
- Probabilistic (logic) programming concepts
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
- Lifted graphical models: a survey
- Lifted variable elimination for probabilistic logic programming
- Lifted variable elimination: decoupling the operators from the constraint language
- Evaluating inference algorithms for the Prolog factor language
Cited In (19)
- GPS trajectory data segmentation based on probabilistic logic
- Evaluating inference algorithms for the Prolog factor language
- An automata view to goal-directed methods
- Title not available (Why is that?)
- Languages for probabilistic modeling over structured and relational domains
- Lifted inference for statistical statements in probabilistic answer set programming
- Tableau reasoning for description logics and its extension to probabilities
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Lower complexity bounds for lifted inference
- Generalized counting for lifted variable elimination
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Lifted discriminative learning of probabilistic logic programs
- Distributed Parameter Learning for Probabilistic Ontologies
- Lifted variable elimination for probabilistic logic programming
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- \textsc{Xeggora}: exploiting immune-to-evidence symmetries with full aggregation in statistical relational models
- The Bayesian ontology language \(\mathcal {BEL}\)
- Lifted graphical models: a survey
- Complexity results for probabilistic answer set programming
Uses Software
This page was built for publication: A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374532)
