- AutorIn
- Carsten Lutz Institute of Theoretical Computer Science TU Dresden
- Maja MiličićInstitute of Theoretical Computer Science TU Dresden
- Titel
- A Tableau Algorithm for DLs with Concrete Domains and GCIs
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-793337
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 05-07
- Erstveröffentlichung
- 2005
- DOI
- https://doi.org/10.25368/2022.150
- Abstract (EN)
- We identify a general property of concrete domains that is sufficient for proving decidability of DLs equipped with them and GCIs. We show that some useful concrete domains, such as temporal one based on the Allen relations and a spatial one based on the RCC-8 relations, have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with such concrete domains.
- Freie Schlagwörter (DE)
- Subsumtion, Beschreibungslogik, GCI, Domäne
- Freie Schlagwörter (EN)
- subsumption, description logic, GCI, domain
- 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-793337
- Veröffentlichungsdatum Qucosa
- 31.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
- CC BY 4.0