Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
From MaRDI portal
Publication:2883089
Recommendations
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Dedicated tabling for a probabilistic setting
- Logic Programming
- Approximate Inference for Logic Programs with Annotated Disjunctions
Cited in
(17)- Dedicated tabling for a probabilistic setting
- Infinite probability computation by cyclic explanation graphs
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Learning Effect Axioms via Probabilistic Logic Programming
- Applying the information bottleneck to statistical relational learning
- Tabling for infinite probability computation
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Optimizing probabilities in probabilistic logic programs
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
- Probabilistic inductive constraint logic
- SLGAD resolution for inference on logic programs with annotated disjunctions
- Structure learning of probabilistic logic programs by searching the clause space
- Learning hierarchical probabilistic logic programs
- MAP inference for probabilistic logic programming
- Abduction with probabilistic logic programming under the distribution semantics
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Tabling with answer subsumption: implementation, applications and performance
This page was built for publication: Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883089)
