CLASSIC'CL: an integrated ILP system

Authors:
Christian Stolle;Andreas Karwath;Luc De Raedt
Affiliations:
Institut für Informatik, Albert-Ludwigs Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs Universität Freiburg, Freiburg, Germany
Venue:
DS'05 Proceedings of the 8th international conference on Discovery Science
Year:
2005

Citing 6
Cited 3

Clausal Discovery

Machine Learning - special issue on inductive logic programming
Logical settings for concept-learning

Artificial Intelligence
Levelwise Search and Borders of Theories in KnowledgeDiscovery

Data Mining and Knowledge Discovery
Inductive Constraint Logic

ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Improving the efficiency of inductive logic programming through the use of query packs

Journal of Artificial Intelligence Research
Top-down induction of first-order logical decision trees

Artificial Intelligence

Learning Horn Expressions with LOGAN-H

The Journal of Machine Learning Research
ALLPAD: approximate learning of logic programs with annotated disjunctions

Machine Learning
ILP, the blind, and the elephant: Euclidean embedding of co-proven queries

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel inductive logic programming system, called Classic'cl is presented. Classic'cl integrates several settings for learning, in particular learning from interpretations and learning from satisfiability. Within these settings, it addresses descriptive and probabilistic modeling tasks. As such, Classic'cl (C-armr, cLAudien, icl-S(S)at, ICl, and CLlpad) integrates several well-known inductive logic programming systems such as Claudien, Warmr (and its extension C-armr), ICL, ICL-SAT, and LLPAD. We report on the implementation, the integration issues as well as on some experiments that compare Classic'cl with some of its predecessors.