1 |
A NExpTime-Complete Description Logic Strictly Contained in C²Tobies, Stephan 20 May 2022 (has links)
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
|
Page generated in 0.0109 seconds