Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics

DOI10.1017/S1471068411000664zbMath1267.68084arXiv1110.0631OpenAlexW2963676309WikidataQ58063746 ScholiaQ58063746MaRDI QIDQ5299588

Fabrizio Riguzzi, Terrance Swift

Publication date: 26 June 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0631

zbMATH Keywords

program transformationtablingprobabilistic logic programminganswer subsumptionlogic programs with annotated disjunction

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

The distribution semantics for normal programs with function symbols, Explanations as programs in probabilistic logic programming, Incremental Tabling in Support of Knowledge Representation and Reasoning, Terminating Evaluation of Logic Programs with Finite Three-Valued Models, Structure learning of probabilistic logic programs by searching the clause space, Inference and learning in probabilistic logic programs using weighted Boolean formulas, Using linear constraints for logic program termination analysis, Bandit-based Monte-Carlo structure learning of probabilistic logic programs, An OpenCL implementation of a forward sampling algorithm for CP-logic, Learning Effect Axioms via Probabilistic Logic Programming, MAP Inference for Probabilistic Logic Programming, Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages, Probabilistic inductive constraint logic, PITA, A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics, Abduction with probabilistic logic programming under the distribution semantics

Uses Software

• XSB

Cites Work

• The independent choice logic for modelling multiple agents under uncertainty
• Tabling for non-monotonic programming
• Logic programming. 24th international conference, ICLP 2008, Udine, Italy, December 9--13 2008. Proceedings
• On the implementation of the probabilistic logic programming language ProbLog
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• On finitely recursive programs
• The Complexity of Enumeration and Reliability Problems
• Tabled evaluation with delaying for general logic programs
• Abducing through negation as failure: stable models within the independent choice logic