Consistency in the description logic ALCOSCC(D), which combines QFBAPA cardinality constraints, concrete domains, feature roles, and nominals, is ExpTime-complete for ExpTime-omega-admissible domains, while several tighter extensions are undecidable.
In: Mylopoulos, J., Reiter, R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
Consistency in the description logic ALCOSCC(D), which combines QFBAPA cardinality constraints, concrete domains, feature roles, and nominals, is ExpTime-complete for ExpTime-omega-admissible domains, while several tighter extensions are undecidable.