Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions

Fabrizio Riguzzi, Terrance Swift

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper presents the algorithm \Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries from Logic Pro- grams with Annotated Disjunctions. PITA is based on a program transformation techniques that adds an extra argument to every atom. PITA uses tabling for saving intermediate results and answer subsumption for combining different answers for the same subgoal. PITA has been implemented in XSB and compared with the ProbLog, cplint and CVE systems. The results show that in almost all cases, PITA is able to solve larger problems and is faster than competing algorithms.

Original languageEnglish (US)
Title of host publicationTechnical Communications of the 26th International Conference on Logic Programming, ICLP 2010
Pages162-171
Number of pages10
DOIs
StatePublished - Dec 1 2010
Event26th International Conference on Logic Programming, ICLP 2010 - Edinburgh, United Kingdom
Duration: Jul 16 2010Jul 19 2010

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume7
ISSN (Print)1868-8969

Other

Other26th International Conference on Logic Programming, ICLP 2010
CountryUnited Kingdom
CityEdinburgh
Period7/16/107/19/10

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions'. Together they form a unique fingerprint.

  • Cite this

    Riguzzi, F., & Swift, T. (2010). Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. In Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010 (pp. 162-171). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 7). https://doi.org/10.4230/LIPIcs.ICLP.2010.162