- AutorIn
- Stefan Borgwardt Theoretical Computer Science, TU Dresden
- Felix DistelTheoretical Computer Science, TU Dresden
- Rafael PeñalozaTheoretical Computer Science, TU Dresden
- Titel
- Gödel Description Logics
- Untertitel
- Decidability in the Absence of the Finitely-Valued Model Property
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-795425
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 13-09
- Erstveröffentlichung
- 2013
- DOI
- https://doi.org/10.25368/2022.199
- Abstract (EN)
- In the last few years there has been a large effort for analysing the computational properties of reasoning in fuzzy Description Logics. This has led to a number of papers studying the complexity of these logics, depending on their chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy DLs w.r.t. witnessed models over the Gödel t-norm. We show that in the logic G-IALC, reasoning cannot be restricted to finitely valued models in general. Despite this negative result, we also show that all the standard reasoning problems can be solved in this logic in exponential time, matching the complexity of reasoning in classical ALC.
- Freie Schlagwörter (DE)
- Subsumtion, ALC-Konzept, Beschreibungslogik, Gödel
- Freie Schlagwörter (EN)
- subsumption, ALC-concept, description logic, Gödel
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-795425
- Veröffentlichungsdatum Qucosa
- 20.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0