$\mathcal{E}$-connections of Description Logics
Aus International Center for Computational Logic
$\mathcal{E}$-connections of Description Logics
O. KutzO. Kutz, C. LutzC. Lutz, F. WolterF. Wolter, M. ZakharyaschevM. Zakharyaschev
O. Kutz, C. Lutz, F. Wolter, M. Zakharyaschev
$\mathcal{E}$-connections of Description Logics
Proceedings of the 2003 International Workshop on Description Logics ({DL2003}), CEUR-WS, 2003
$\mathcal{E}$-connections of Description Logics
Proceedings of the 2003 International Workshop on Description Logics ({DL2003}), CEUR-WS, 2003
- KurzfassungAbstract
Recently, E-connections have been proposed as a new means forconnecting knowledge representation systems. We illustrate how this connection technique can be used for combining description logics, thereby surveying various extensions of the original E-connections. For all these extensions, general transfer results for concept
satisfiability are given. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ KuLuWoZa-DL2003,
author = {O. {Kutz} and C. {Lutz} and F. {Wolter} and M. {Zakharyaschev}},
booktitle = {Proceedings of the 2003 International Workshop on Description Logics ({DL2003})},
series = {CEUR-WS},
title = {$\mathcal{E}$-connections of Description Logics},
year = {2003},
}
