The problem of rewriting a concept given a terminology can informally be stated as follows: given a terminology T (i.e., a set of concept deenitions) and a concept description C that does not contain concept names deened in T , can this description be rewritten into a \related better" description E by using (some of) the names deened in T ? In this paper,… (More)
Computing the least common subsumer (lcs) is an inference task that can be used to support the \bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new… (More)
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issues or not. We concentrated on those representation formalisms that either (1) had or have a strong influence on Description Logics (e.g., modal logics), (2) are closely related to… (More)
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar.