75 search results - page 2 / 15 » Partial and Informative Common Subsumers in Description Logi... |
AICOM
2006
13 years 5 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
DLOG
2001
13 years 6 months ago
2001
For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descripti...
DLOG
2001
13 years 6 months ago
2001
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
JELIA
2004
Springer
13 years 10 months ago
2004
Springer
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
DLOG
2003
13 years 6 months ago
2003
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...