License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.162
URN: urn:nbn:de:0030-drops-25948
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2594/
Go to the corresponding LIPIcs Volume Portal


Riguzzi, Fabrizio ; Swift, Terrance

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

pdf-format:
10003.RiguzziFabrizio.2594.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{riguzzi_et_al:LIPIcs:2010:2594,
  author =	{Fabrizio Riguzzi and Terrance Swift},
  title =	{{Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{162--171},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Manuel Hermenegildo and Torsten Schaub},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2594},
  URN =		{urn:nbn:de:0030-drops-25948},
  doi =		{10.4230/LIPIcs.ICLP.2010.162},
  annote =	{Keywords: Probabilistic Logic Programming, Tabling, Answer Subsumption, Logic Programs with Annotated Disjunction, Program Transformation}
}

Keywords: Probabilistic Logic Programming, Tabling, Answer Subsumption, Logic Programs with Annotated Disjunction, Program Transformation
Collection: Technical Communications of the 26th International Conference on Logic Programming
Issue Date: 2010
Date of publication: 25.06.2010


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI