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

07/24/2011
by   Fabrizio Riguzzi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2011

Well-Definedness and Efficient Inference for Probabilistic Logic Programming under the Distribution Semantics

The distribution semantics is one of the most prominent approaches for t...
research
10/06/2022

Explanations as Programs in Probabilistic Logic Programming

The generation of comprehensible explanations is an essential feature of...
research
05/22/2019

Scientific Programs Imply Uncertainty. Results Expected and Unexpected

Science and engineering have requests for a wide variety of programs, bu...
research
04/05/2013

Probability Aggregates in Probability Answer Set Programming

Probability answer set programming is a declarative programming that has...
research
09/11/2021

On syntactically similar logic programs and sequential decompositions

Rule-based reasoning is an essential part of human intelligence prominen...
research
07/19/2017

Computing LPMLN Using ASP and MLN Solvers

LPMLN is a recent addition to probabilistic logic programming languages....
research
08/06/2020

Incremental maintenance of overgrounded logic programs with tailored simplifications

The repeated execution of reasoning tasks is desirable in many applicati...

Please sign up or login with your details

Forgot password? Click here to reset