Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics

Authors:
Fabrizio Riguzzi
Affiliations:
ENDIF, Università di Ferrara, Ferrara, Italy 44100
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 5
Cited 2

Modular acyclicity and tail recursion in logic programs

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query evaluation under the well-founded semantics

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The independent choice logic for modelling multiple agents under uncertainty

Artificial Intelligence - Special issue on economic principles of multi-agent systems
Suspending and Resuming Computations in Engines for SLG Evaluation

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
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

MCINTYRE: A Monte Carlo System for Probabilistic Logic Programming

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Expectation maximization over binary decision diagrams for probabilistic logic programs

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

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 well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. The paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is based on SLG resolution for normal logic programs. SLGAD is evaluated on classical benchmarks for well founded semantics inference algorithms, namely the stalemate game and the ancestor relation. SLGAD is compared with Cilog2 and SLDNFAD, an algorithm based on SLDNF, on the programs that are modularly acyclic. The results show that SLGAD deals correctly with cyclic programs and, even if it is more expensive than SLDNFAD on problems where SLDNFAD succeeds, is faster than Cilog2 when the query is true in an exponential number of instances.