Return to search

A NExpTime-Complete Description Logic Strictly Contained in C²

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

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78886
Date20 May 2022
CreatorsTobies, Stephan
PublisherAachen University of Technology
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relationurn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504

Page generated in 0.005 seconds