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

Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with Annotated Disjunctions (LPADs) represents probabilistic information in a sound and simple way. This paper presents two contributions to the evaluation of LPADs. The first is the definition of a semantics for LPADs with function symbols, which is needed for many domains (including some standard benchmarks used in this paper). The second is the algorithm “Probabilistic Inference with Tabling and Answer subsumption” (PITA) for computing the probability of queries. Answer subsumption is a feature of tabling that allows the combination of different answers for the same subgoal in the case in which a partial order can be defined over them. We have applied it in our case since probabilistic explanations (stored as BDDs in PITA) possess a natural lattice structure. PITA has been implemented in XSB and compared...

• Type: Conference
• Year: 2010
• Where: ICLP
• Authors: Fabrizio Riguzzi, Terrance Swift
• Keywords: Answer Subsumption, Automated Reasoning, ICLP 2010, Logic Programming, Probabilistic