Attributive concept descriptions with complements
Artificial Intelligence
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
Cardinality restrictions on concepts
Artificial Intelligence
The complexity of concept languages
Information and Computation
Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Description Logics with Inverse Roles, Functional Restrictions, and N-ary Relations
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Complexity of Two-Variable Logic with Counting
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic with counting is decidable
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A semantics and complete algorithm for subsumption in the classic description logic
Journal of Artificial Intelligence Research
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
LTL over description logic axioms
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
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 c2, the two variable fragment of predicate logic with counting quantifiers. We prove that ALCQI has the same complexity as c2 but does not reach its expressive power.