The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty

Abstract

Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability. Each of these approaches -- general PLP, restricted PLP, and Possibilistic Logic Programming -- can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of the problems to be solved. In this paper, we show how the PITA system, which originally supported the general PLP language of LPADs, can also efficiently support restricted PLP and Possibilistic Logic Programs. PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption.

References in corpus (4)

• Bayesian Logic Programs
• CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
• Possibilistic Answer Set Programming Revisited
• The Language Features and Architecture of B-Prolog

Cited by in corpus (19)

• Hinge-Loss Markov Random Fields and Probabilistic Soft Logic
• Scaling Exact Inference for Discrete Probabilistic Programs
• Structure Learning of Probabilistic Logic Programs by Searching the Clause Space
• Lifted Variable Elimination for Probabilistic Logic Programming
• Efficient Knowledge Compilation Beyond Weighted Model Counting
• Probabilistic Programming Concepts
• MAP Inference for Probabilistic Logic Programming
• Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
• Infinite probability computation by cyclic explanation graphs
• Adaptive MCMC-Based Inference in Probabilistic Logic Programs
• Viterbi training in PRISM
• PASOCS: A Parallel Approximate Solver for Probabilistic Logic Programs under the Credal Semantics
• Bottom-Up Stratified Probabilistic Logic Programming with Fusemate
• Inference in Probabilistic Logic Programs using Lifted Explanations
• Model Checking with Probabilistic Tabled Logic Programming
• An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
• Value of Information in Probabilistic Logic Programs
• A Preliminary Report on Probabilistic Attack Normal Form for Constellation Semantics
• Integrating Belief Domains into Probabilistic Logic Programs