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

DOI10.1017/S1471068411000664zbMATH Open1267.68084arXiv1110.0631OpenAlexW2963676309WikidataQ58063746 ScholiaQ58063746MaRDI QIDQ5299588FDOQ5299588

Authors: Fabrizio Riguzzi, Terrance Swift 

Publication date: 26 June 2013

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

Abstract: The distribution semantics is one of the most prominent approaches for the combination of logic programming and probability theory. Many languages follow this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (LPADs) and ProbLog. When a program contains functions symbols, the distribution semantics is well-defined only if the set of explanations for a query is finite and so is each explanation. Well-definedness is usually either explicitly imposed or is achieved by severely limiting the class of allowed programs. In this paper we identify a larger class of programs for which the semantics is well-defined together with an efficient procedure for computing the probability of queries. Since LPADs offer the most general syntax, we present our results for them, but our results are applicable to all languages under the distribution semantics. We present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) that computes the probability of queries by transforming a probabilistic program into a normal program and then applying SLG resolution with answer subsumption. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog, cplint and CVE, PITA was almost always able to solve larger problems in a shorter time, on domains with and without function symbols.

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

Recommendations

• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• On the semantics and complexity of probabilistic logic programs
• Inference in probabilistic logic programs with continuous random variables
• A new probabilistic constraint logic programming language based on a generalised distribution semantics
• Abduction with probabilistic logic programming under the distribution semantics
• An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
• scientific article; zbMATH DE number 7102019
• Probabilistic logic programming
• Logic Programming and Nonmonotonic Reasoning

zbMATH Keywords

probabilistic logic programmingprogram transformationtablinganswer subsumptionlogic programs with annotated disjunction

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

Cited In (21)

• Using SWISH to realize interactive web-based tutorials for logic-based languages
• Learning Effect Axioms via Probabilistic Logic Programming
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• The distribution semantics for normal programs with function symbols
• PITA
• Explanations as programs in probabilistic logic programming
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• A new probabilistic constraint logic programming language based on a generalised distribution semantics
• Logic Programming and Nonmonotonic Reasoning
• Probabilistic inductive constraint logic
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• Syntactic requirements for well-defined hybrid probabilistic logic programs
• Structure learning of probabilistic logic programs by searching the clause space
• Terminating evaluation of logic programs with finite three-valued models
• Using linear constraints for logic program termination analysis
• 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 and answer subsumption for reasoning on logic programs with annotated disjunctions
• Incremental Tabling in Support of Knowledge Representation and Reasoning
• A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics

Uses Software

• XSB

This page was built for publication: Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299588)