PITA

swMATH6950MaRDI QIDQ19014FDOQ19014

Author name not available (Why is that?)

Described by source

• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics

Cited In (22)

• Viterbi training in PRISM
• Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
• Title not available (Why is that?)
• A functional account of probabilistic programming with possible worlds. Declarative pearl
• Probabilistic abstract argumentation frameworks, a possible world view
• Constraint-Based Inference in Probabilistic Logic Programs
• Title not available (Why is that?)
• Learning Effect Axioms via Probabilistic Logic Programming
• MAP Inference for Probabilistic Logic Programming
• The distribution semantics for normal programs with function symbols
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• Title not available (Why is that?)
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Probabilistic (logic) programming concepts
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• Efficient Knowledge Compilation Beyond Weighted Model Counting
• Lifted discriminative learning of probabilistic logic programs
• Structure learning of probabilistic logic programs by searching the clause space
• Learning hierarchical probabilistic logic programs
• Causal inference in cplint
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• Constructing generative logical models for optimisation problems using domain knowledge

This page was built for software: PITA