On the Efficient Execution of ProbLog Programs
From MaRDI portal
Publication:5504655
DOI10.1007/978-3-540-89982-2_22zbMATH Open1185.68162OpenAlexW1560531798MaRDI QIDQ5504655FDOQ5504655
Authors: Angelika Kimmig, Vítor Costa, Ricardo Rocha, Bart Demoen, Luc De Raedt 
Publication date: 22 January 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/199133
Recommendations
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- Probabilistic Horn abduction and Bayesian networks
- Abducing through negation as failure: stable models within the independent choice logic
- Title not available (Why is that?)
- Logic Programming
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Probabilistic (logic) programming concepts
- Title not available (Why is that?)
- Compressing probabilistic Prolog programs
Cited In (12)
- Dedicated tabling for a probabilistic setting
- Viterbi training in PRISM
- Probabilistic logic programming for hybrid relational domains
- Title not available (Why is that?)
- 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
Uses Software
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)
