Role Conjunctions in Expressive Description Logics

Authors:
Birte Glimm;Yevgeny Kazakov
Affiliations:
Oxford University Computing Laboratory,;Oxford University Computing Laboratory,
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 7
Cited 0

Alternation

Journal of the ACM (JACM)
The Classical Decision Problem, Egon Börger, Erich Grädel, and Yuri Gurevich

Journal of Logic, Language and Information
The Description Logic Handbook

The Description Logic Handbook
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$

Journal of Automated Reasoning
The complexity of reasoning with cardinality restrictions and nominals in expressive description logics

Journal of Artificial Intelligence Research
Conjunctive query answering for the description logic SHIQ

Journal of Artificial Intelligence Research
A correspondence theory for terminological logics: preliminary report

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that adding role conjunctions to the Description Logics (DLs) $\mathcal{SHI}$ and $\mathcal{SHOIF}$ causes a jump in the computational complexity of the standard reasoning tasks from ExpTime -complete to 2ExpTime -complete and from NExpTime -complete to N2ExpTime -hard respectively. We further show that this increase is due to a subtle interaction between inverse roles, role hierarchies, and role transitivity in the presence of role conjunctions and that for the DL $\mathcal{SHQ}$ a jump in the computational complexity cannot be observed.