- Titel
- A NExpTime-Complete Description Logic Strictly Contained in C²
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-788869
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 99-05
- Erstveröffentlichung
- 1999
- DOI
- https://doi.org/10.25368/2022.91
- Abstract (EN)
- We examine the complexity and expressivity of the combination of the Description Logic ALCQI with a terminological formalism based on cardinality restrictions on concepts. This combination can naturally be embedded into C², the two variable fragment of predicate logic with counting quantifiers. We prove that ALCQI has the same complexity as C² but does not reach its expressive power.
- An abriged version of this paper has been submitted to CSL'99
- Freie Schlagwörter (DE)
- Beschreibungslogik, Kardinalität-Beschränkungen, eingebettet, Prädikatenlogik
- Freie Schlagwörter (EN)
- Description Logic, cardinality restrictions, embedded, predicate logic
- 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-788869
- Veröffentlichungsdatum Qucosa
- 20.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0