- Titel
- Towards Extending the Description Logic FL0 with Threshold Concepts Using Weighted Tree Automata
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-935396
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 23-04
- Erstveröffentlichung
- 2023
- DOI
- https://doi.org/10.25368/2024.241
- Abstract (EN)
- We introduce an extension of the Description Logic FL0 that allows us to define concepts in an approximate way. More precisely, we extend FL0 with a threshold concept constructor of the form Ct><l t for t><l ∈ {≤, <, ≥, >}, whose semantics is given by using a membership distance function (mdf). A membership distance function m assigns to each domain element and concept a distance value expressing how “close” is such element to being an instance of the concept. Based on this, a threshold concept Ct><l t is interpreted as the set of all domain elements that have a distance s from C such that s t><l t. We provide a framework to obtain membership distance functions based on functions that compare tuples of languages, and we show how weighted looping tree automata over a semiring can be used to define membership distance functions for FL0 concepts.
- This is an extended version of an article accepted at the 36th International Workshop on Description Logics (DL 2023).
- Freie Schlagwörter (EN)
- description logic, approximate way, distance function
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Herausgeber (Institution)
- Technische Universität Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-935396
- Veröffentlichungsdatum Qucosa
- 02.09.2024
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0