Sciweavers

13 search results - page 1 / 3
» Computing Least Common Subsumers for FLE
Sort
View
DLOG
2003
13 years 6 months ago
Computing Least Common Subsumers for FLE+
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...
Sebastian Brandt, Anni-Yasmin Turhan
AUSAI
1999
Springer
13 years 9 months ago
Computing Least Common Subsumers in Expressive Description Logics
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...
Thomas Mantay
JELIA
2004
Springer
13 years 10 months ago
Computing the Least Common Subsumer w.r.t. a Background Terminology
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...
Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
DLOG
2009
13 years 2 months ago
A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts.
Francesco M. Donini, Simona Colucci, Tommaso Di No...
KI
1999
Springer
13 years 9 months ago
Computing Probabilistic Least Common Subsumers in Description Logics
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...
Thomas Mantay, Ralf Möller, Alissa Kaplunova