A Compact Representation for Least Common Subsumers in the Description Logic ALE - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue AI Communications Année : 2006
Fichier non déposé

Dates et versions

hal-01516224 , version 1 (29-04-2017)

Identifiants

  • HAL Id : hal-01516224 , version 1

Citer

Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousset. A Compact Representation for Least Common Subsumers in the Description Logic ALE: This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALE-concept descriptions. Based on the compact representation we define a space of specific graphs which represents all ALE-concept descriptions including the lcs. Next, we propose an algorithm exponential in time and polynomial in space for deciding subsumption between concept descriptions represented by graphs in this space. These results provide better understanding of the double exponential blow-up of the approximation of ALC-concept descriptions by ALE-concept descriptions: double exponential size of the approximation in the ordinary representation is unavoidable in the worst case.. AI Communications, 2006, 19 (3), pp.239-273. ⟨hal-01516224⟩
128 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More