PITA

swMATH6950MaRDI QIDQ19014FDOQ19014

Author name not available (Why is that?)

Official website: https://sites.google.com/a/unife.it/ml/pita

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 (45)

• Viterbi training in PRISM
• 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
• Title not available (Why is that?)
• Learning Effect Axioms via Probabilistic Logic Programming
• BousiProlog
• The distribution semantics for normal programs with function symbols
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
• CP-logic
• ProbLog
• YAP-Prolog
• IBAL
• HermiT
• SPOOK
• foxPSL
• XSB
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Probabilistic (logic) programming concepts
• PRISM
• Datafun
• BLOG
• cplint
• MCINTYRE
• ClaimEval
• HyPER
• NoHR
• KL-ONE
• PFLP
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• FASILL
• FactorBase
• HgMUS
• 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
• RelNN
• Constraint-based inference in probabilistic logic programs
• Learning hierarchical probabilistic logic programs
• MAP inference for probabilistic logic programming
• Causal inference in cplint
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• Hinge-loss Markov random fields and probabilistic soft logic
• Constructing generative logical models for optimisation problems using domain knowledge

This page was built for software: PITA