Sciweavers

Share
CADE
2008
Springer

The Complexity of Conjunctive Query Answering in Expressive Description Logics

9 years 2 months ago
The Complexity of Conjunctive Query Answering in Expressive Description Logics
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing open problem. We determine the complexity of conjunctive query answering in expressive DLs between ALC and SHIQ, and thus settle the problem. In a nutshell, we show that conjunctive query answering is 2ExpTime-complete in the presence of inverse roles, and only ExpTime-complete without them.
Carsten Lutz
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2008
Where CADE
Authors Carsten Lutz
Comments (0)
books