On the Efficient Execution of ProbLog Programs
From MaRDI portal
Publication:5504655
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 1950779 (Why is no real title available?)
- scientific article; zbMATH DE number 1753155 (Why is no real title available?)
- Abducing through negation as failure: stable models within the independent choice logic
- Compressing probabilistic Prolog programs
- Graph-Based Algorithms for Boolean Function Manipulation
- Logic Programming
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Probabilistic (logic) programming concepts
- Probabilistic Horn abduction and Bayesian networks
Cited in
(12)- Dedicated tabling for a probabilistic setting
- Viterbi training in PRISM
- Probabilistic logic programming for hybrid relational domains
- scientific article; zbMATH DE number 7453105 (Why is no real title available?)
- Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic
- Probabilistic (logic) programming concepts
- Compressing probabilistic Prolog programs
- Probabilistic inductive querying using \texttt{ProbLog}
- Neural probabilistic logic programming in DeepProbLog
- Probabilistic Rule Learning in Nonmonotonic Domains
- Planning in hybrid relational MDPs
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
This page was built for publication: On the Efficient Execution of ProbLog Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504655)