Skip to Main content Skip to Navigation
Journal articles

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.

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01516224
Contributor : Nhan Le Thanh <>
Submitted on : Saturday, April 29, 2017 - 8:53:55 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:29 PM

Identifiers

  • HAL Id : hal-01516224, version 1

Citation

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, IOS Press, 2006, 19 (3), pp.239-273. ⟨hal-01516224⟩

Share

Metrics

Record views

249