Explanations as programs in probabilistic logic programming
From MaRDI portal
Recommendations
- Inference in probabilistic logic programs using lifted explanations
- The complexity of inferences and explanations in probabilistic logic programming
- Probabilistic logic programming
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Probabilistic description logic programs
- On computing probabilistic abductive explanations
- Expressive probabilistic description logics
- Learning logic programs by explaining their failures
Cites work
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1875392 (Why is no real title available?)
- scientific article; zbMATH DE number 7455706 (Why is no real title available?)
- scientific article; zbMATH DE number 7455713 (Why is no real title available?)
- scientific article; zbMATH DE number 7102019 (Why is no real title available?)
- A hybrid approach to conjunctive partial evaluation of logic programs
- An analysis of loop checking mechanisms for logic programs
- Explanations as programs in probabilistic logic programming
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Logic Programming
- Loop checking in partial deduction
- On the implementation of the probabilistic logic programming language ProbLog
- Optimizing probabilities in probabilistic logic programs
- Partial evaluation in logic programming
- Probabilistic (logic) programming concepts
- Probabilistic Horn abduction and Bayesian networks
- Recommender Systems Handbook
- Speedup of logic programs by binarization and partial deduction
- The independent choice logic for modelling multiple agents under uncertainty
- Transformation of logic programs: Foundations and techniques
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
Cited in
(5)- Explanations as programs in probabilistic logic programming
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- scientific article; zbMATH DE number 4162322 (Why is no real title available?)
- Context-sensitive meta-constraint systems for explainable program analysis
- Declarative reasoning on explanations using constraint logic programming
This page was built for publication: Explanations as programs in probabilistic logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163172)
