An OpenCL implementation of a forward sampling algorithm for CP-logic
From MaRDI portal
Recommendations
- Parallel abductive query answering in probabilistic logic programs
- Distribution-aware sampling of answer sets
- Probabilistic logic programming with conditional constraints
- Approximate Inference for Logic Programs with Annotated Disjunctions
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
Cites work
- scientific article; zbMATH DE number 1753155 (Why is no real title available?)
- scientific article; zbMATH DE number 918134 (Why is no real title available?)
- Abducing through negation as failure: stable models within the independent choice logic
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- Monte-Carlo approximation algorithms for enumeration problems
- On the implementation of the probabilistic logic programming language ProbLog
- SLGAD resolution for inference on logic programs with annotated disjunctions
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- The well-founded semantics for general logic programs
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- \(k\)-optimal: a novel approximate inference algorithm for ProbLog
This page was built for publication: An OpenCL implementation of a forward sampling algorithm for CP-logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900368)
