Approximate inference for logic programs with annotated disjunctions

Authors:
Stefano Bragaglia;Fabrizio Riguzzi
Affiliations:
DEIS - University of Bologna, ENDIF - University of Ferrara;DEIS - University of Bologna, ENDIF - University of Ferrara
Venue:
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Year:
2010

Citing 4
Cited 1

A Top Down Interpreter for LPAD and CP-Logic

AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
On the Efficient Execution of ProbLog Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ProbLog: a probabilistic prolog and its application in link discovery

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods

ILP'09 Proceedings of the 19th international conference on Inductive logic programming

MCINTYRE: A Monte Carlo System for Probabilistic Logic Programming

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic Programs with Annotated Disjunctions (LPADs) are a promising language for Probabilistic Inductive Logic Programming. In order to develop efficient learning systems for LPADs, it is fundamental to have high-performing inference algorithms. The existing approaches take too long or fail for large problems. In this paper we adapt to LPAD the approaches for approximate inference that have been developed for ProbLog, namely k-best and Monte Carlo. k-Best finds a lower bound of the probability of a query by identifying the k most probable explanations while Monte Carlo estimates the probability by smartly sampling the space of programs. The two techniques have been implemented in the cplint suite and have been tested on real and artificial datasets representing graphs. The results show that both algorithms are able to solve larger problems often in less time than the exact algorithm.