The PITA system: tabling and answer subsumption for reasoning under uncertainty. 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.par 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. We show that, by adapting its transformation and library functions, PITA can be parameterized to PITA(IND, EXC) which supports the restricted PLP of PRISM, including optimizations that reduce non-discriminating arguments and the computation of Viterbi paths. Furthermore, we show PITA to be competitive with PRISM for complex queries to Hidden Markov Model examples, and sometimes much faster. We further show how PITA can be parameterized to PITA(COUNT) which computes the number of different explanations for a subgoal, and to PITA(POSS) which scalably implements possibilistic logic programming. PITA is a supported package in version 3.3 of XSB.

References in zbMATH (referenced in 12 articles , 2 standard articles )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Bach, Stephen H.; Broecheler, Matthias; Huang, Bert; Getoor, Lise: Hinge-loss Markov random fields and probabilistic soft logic (2017)
  2. Riguzzi, Fabrizio; Cota, Giuseppe; Bellodi, Elena; Zese, Riccardo: Causal inference in cplint (2017)
  3. Riguzzi, Fabrizio: The distribution semantics for normal programs with function symbols (2016)
  4. Vlasselaer, Jonas; Van den Broeck, Guy; Kimmig, Angelika; Meert, Wannes; De Raedt, Luc: $T_\mathcalP$-compilation for inference in probabilistic logic programs (2016)
  5. Bellodi, Elena; Riguzzi, Fabrizio: Structure learning of probabilistic logic programs by searching the clause space (2015)
  6. De Raedt, Luc; Kimmig, Angelika: Probabilistic (logic) programming concepts (2015)
  7. Di Mauro, Nicola; Bellodi, Elena; Riguzzi, Fabrizio: Bandit-based Monte-Carlo structure learning of probabilistic logic programs (2015)
  8. Sato, Taisuke; Kubota, Keiichi: Viterbi training in PRISM (2015)
  9. Van Ranst, Wiebe; Vennekens, Joost: An OpenCL implementation of a forward sampling algorithm for CP-logic (2015)
  10. Riguzzi, Fabrizio; Swift, Terrance: Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics (2013)
  11. Riguzzi, Fabrizio; Swift, Terrance: The PITA system: tabling and answer subsumption for reasoning under uncertainty (2011)
  12. Riguzzi, Fabrizio; Swift, Terrance: Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions (2010)