8 search results - page 1 / 2 » Using Lazy Unfolding for the Computation of Least Common Sub... |
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...
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...
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...
AAAI
1997
13 years 6 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
DLOG
2004
13 years 6 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...