ALLPAD: Approximate learning of logic programs with annotated disjunctions

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for representing probabilistic knowledge in logic programming. In this paper we consider the problem of learning ground LPADs starting from a set of interpretations annotated with their probability. We present the system ALLPAD for solving this problem. ALLPAD modifies the previous system LLPAD in order to tackle real world learning problems more effectively. This is achieved by looking for an approximate solution rather than a perfect one. A number of experiments have been performed on real and artificial data for evaluating ALLPAD, showing the feasibility of the approach. © 2007 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Riguzzi, F. (2008). ALLPAD: Approximate learning of logic programs with annotated disjunctions. Machine Learning, 70(2–3), 207–223. https://doi.org/10.1007/s10994-007-5032-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free