Computing least common subsumers for FLE^+
Aus International Center for Computational Logic
Computing least common subsumers for FLE^+
Sebastian BrandtSebastian Brandt, Anni-Yasmin TurhanAnni-Yasmin Turhan
Sebastian Brandt, Anni-Yasmin Turhan
Computing least common subsumers for FLE^+
Proceedings of the 2003 International Workshop on Description Logics, CEUR-WS, 2003
Computing least common subsumers for FLE^+
Proceedings of the 2003 International Workshop on Description Logics, CEUR-WS, 2003
- KurzfassungAbstract
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 in a description logic with transitive roles. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BrandtTurhan-DL03,
author = {Sebastian {Brandt} and Anni-Yasmin {Turhan}},
booktitle = {Proceedings of the 2003 International Workshop on Description Logics},
series = {CEUR-WS},
title = {Computing least common subsumers for \ensuremath{\cal F\!L\!E^+}},
year = {2003},
}
