LIPIcs.ICLP.2010.162.pdf
- Filesize: 0.58 MB
- 10 pages
Document
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Authors
-
Part of:
Volume:
Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2010-06-25
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)
https://doi.org/10.4230/LIPIcs.ICLP.2010.162
https://doi.org/10.4230/LIPIcs.ICLP.2010.162
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.
Keywords
- Probabilistic Logic Programming
- Tabling
- Answer Subsumption
- Logic Programs with Annotated Disjunction
- Program Transformation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads