- AutorIn
- Franz Baader Theoretical Computer Science, RWTH Aachen
- Ralf KüstersTheoretical Computer Science, CAU Kiel
- Titel
- Unification in a Description Logic with Transitive Closure of Roles
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-789915
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 01-05
- Erstveröffentlichung
- 2001
- DOI
- https://doi.org/10.25368/2022.115
- Abstract (EN)
- Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL₀, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic. These results are proved via a reduction to linear equations over regular languages, which are then solved using automata. The obtained results are also of interest in formal language theory.
- An abridged version will appear in Proc. LPAR'01.
- Freie Schlagwörter (DE)
- ExpTime, Beschreibungslogik, PSpace, automatisiertes Auflösen
- Freie Schlagwörter (EN)
- ExpTime, description logic, PSpace, automata solving
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Aachen University of Technology, Aachen
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-789915
- Veröffentlichungsdatum Qucosa
- 24.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
- CC BY 4.0