Towards Learning in CARIN-ALN

  • Céline Rouveirol
  • Véronique Ventos
Conference paper

DOI: 10.1007/3-540-44960-4_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1866)
Cite this paper as:
Rouveirol C., Ventos V. (2000) Towards Learning in CARIN-ALN. In: Cussens J., Frisch A. (eds) Inductive Logic Programming. ILP 2000. Lecture Notes in Computer Science, vol 1866. Springer, Berlin, Heidelberg

Abstract

In this paper we investigate a new language for learning, which combines two well-known representation formalisms, Description Logics and Horn Clause Logics. Our goal is to study the feasability of learning in such a hybrid description - horn clause language, namely CARIN-ALN [LR98b], in the presence of hybrid background knowledge, including a Horn clause and a terminological component. After setting our learning framework, we present algorithms for testing example coverage and subsumption between two hypotheses, based on the existential entailment algorithm studied in[LR98b]. While the hybrid language is more expressive than horn clause logics alone, the complexity of these two steps for CARIN-ALN remains bounded by their respective complexity in horn clause logics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Céline Rouveirol
    • 1
  • Véronique Ventos
    • 1
  1. 1.Laboratoire de Recherche en InformatiqueUniversité Paris-SudOrsay CedexFrance

Personalised recommendations