On the Computation of Common Subsumers in Description Logics
Description logics (DL) knowledge bases are often build by users with expertise in the application domain, but little expertise in logic. To support this kind of users when building their knowledge bases a number of extension methods have been proposed to provide the user with concept descriptions a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
2008
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:14-ds-1212159862343-11479 http://nbn-resolving.de/urn:nbn:de:bsz:14-ds-1212159862343-11479 http://www.qucosa.de/fileadmin/data/qucosa/documents/649/1212159862343-1147.pdf |
| Summary: | Description logics (DL) knowledge bases are often build by users with expertise in the application domain, but little expertise in logic. To support this kind of users when building their knowledge bases a number of extension methods have been proposed to provide the user with concept descriptions as a starting point for new concept definitions. The inference service central to several of these approaches is the computation of (least) common subsumers of concept descriptions. In case disjunction of concepts can be expressed in the DL under consideration, the least common subsumer (lcs) is just the disjunction of the input concepts. Such a trivial lcs is of little use as a starting point for a new concept definition to be edited by the user. To address this problem we propose two approaches to obtain "meaningful" common subsumers in the presence of disjunction tailored to two different methods to extend DL knowledge bases. More precisely, we devise computation methods for the approximation-based approach and the customization of DL knowledge bases, extend these methods to DLs with number restrictions and discuss their efficient implementation. |
|---|