Sciweavers

Share
FUIN
2010

SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions

8 years 2 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well-founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. Inference on LPADs can be performed using either the system Ailog2, that was developed for the Independent Choice Logic, or SLDNFAD, an algorithm based on SLDNF. However, both of these algorithms run the risk of going into infinite loops and of performing redundant computations. In order to avoid these problems, we present SLGAD resolution that computes the (conditional) probability of a ground query from a range-restricted LPAD and is based on SLG resolution for normal logic programs. As SLG, it uses tabling to avoid some infinite loops and to avoid redundant computations. The performances of SLGAD are evaluated on classical benchmarks for normal logic programs under the well-founded semantics, nam...
Fabrizio Riguzzi
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Where FUIN
Authors Fabrizio Riguzzi
Comments (0)
books