24 search results - page 1 / 5 » Computing Probabilistic Least Common Subsumers in Descriptio... |
KI
1999
Springer
13 years 9 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
DLOG
2009
13 years 2 months ago
2009
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts.
AUSAI
1999
Springer
13 years 9 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
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...