TY - GEN
T1 - Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
AU - Riguzzi, Fabrizio
AU - Swift, Terrance
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84880225401&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880225401&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.ICLP.2010.162
DO - 10.4230/LIPIcs.ICLP.2010.162
M3 - Conference contribution
AN - SCOPUS:84880225401
SN - 9783939897170
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 162
EP - 171
BT - Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010
T2 - 26th International Conference on Logic Programming, ICLP 2010
Y2 - 16 July 2010 through 19 July 2010
ER -