ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctions

Authors:
Fabrizio Riguzzi
Affiliations:
Dipartimento di Ingegneria, Università di Ferrara, Via Saragat 1, 44100 Ferrara, Italy
Venue:
Inductive Logic Programming
Year:
2007

Citing 3
Cited 2

The effect of relational background knowledge on learning of protein three-dimensional fold signatures

Machine Learning - Special issue on inducive logic programming
Logical hidden Markov models

Journal of Artificial Intelligence Research
TildeCRF: conditional random fields for logical sequences

ECML'06 Proceedings of the 17th European conference on Machine Learning

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

In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). 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. ALLPAD has been tested on the problem of classifying proteins according to their tertiary structure and the results compare favorably with most other approaches.