Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions

Authors Fabrizio Riguzzi, Terrance Swift

Thumbnail PDF


  • Filesize: 0.58 MB
  • 10 pages

Document Identifiers

Author Details

Fabrizio Riguzzi
Terrance Swift

Cite AsGet BibTex

Fabrizio Riguzzi and Terrance Swift. Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 162-171, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


The paper presents the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries from Logic Programs 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.
  • Probabilistic Logic Programming
  • Tabling
  • Answer Subsumption
  • Logic Programs with Annotated Disjunction
  • Program Transformation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail