Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. (English) Zbl 1237.68049

Riguzzi, Fabrizio; Swift, Terrance

Hermenegildo, Manuel (ed.) et al., Technical communications of the 26th international conference on logic programming (ICLP 2010), July 16–19, 2010, Edinburgh, Scotland, UK. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-17-0). LIPIcs – Leibniz International Proceedings in Informatics 7, 162-171, electronic only (2010).

Summary: 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.
For the entire collection see [Zbl 1213.68040].

MSC:

68N17	Logic programming
03B48	Probability and inductive logic
68T37	Reasoning under uncertainty in the context of artificial intelligence

Keywords:

probabilistic logic programming; tabling; answer subsumption; logic programs with annotated disjunction; program transformation

Software:

CP-logic; PITA; ProbLog; XSB