- Titel
- A Tableau Algorithm for SROIQ under Infinitely Valued Gödel Semantics
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-795708
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 15-18
- Erstveröffentlichung
- 2015
- DOI
- https://doi.org/10.25368/2022.223
- Abstract (EN)
- Fuzzy description logics (FDLs) are knowledge representation formalisms capable of dealing with imprecise knowledge by allowing intermediate membership degrees in the interpretation of concepts and roles. One option for dealing with these intermediate degrees is to use the so-called Gödel semantics. Despite its apparent simplicity, developing reasoning techniques for expressive FDLs under this semantics is a hard task. We present a tableau algorithm for deciding consistency of a SROIQ ontology under Gödel semantics. This is the first algorithm that can handle the full expressivity of SROIQ as well as the full Gödel semantics.
- Freie Schlagwörter (DE)
- Subsumtion, Gödelscher Vollständigkeitssatz, Beschreibungslogik, Unschärfelogik
- Freie Schlagwörter (EN)
- subsumption, Gödel's completeness theorem, description logic, fuzzy logic
- 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-795708
- Veröffentlichungsdatum Qucosa
- 20.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0