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

摘要

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