Abstract
In two previous publications we have, on the one hand, extended the description logic (DL)
ALCQ
by more expressive number restrictions using numerical and set constraints expressed in the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA). The resulting DL was called
ALCSCC
. On the other hand, we have extended the terminological formalism of the well-known description logic
ALC
from concept inclusions (CIs) to more general cardinality constraints expressed in QFBAPA, which we called extended cardinality constraints. Here, we combine the two extensions, i.e., we consider extended cardinality constraints on
ALCSCC
concepts. We show that this does not increase the complexity of reasoning, which is NExpTime-complete both for extended cardinality constraints in the DL
ALC
and in its extension
ALCSCC
. The same is true for a restricted version of such cardinality constraints, where the complexity of reasoning decreases to ExpTime, not just for
ALC
, but also for
ALCSCC.
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献