Conjunctive Query Answering for the Description Logic SHIQ


Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, it was an open problem whether conjunctive query answering over DL knowledge bases is decidable if transitive roles are admitted in the query. In this paper, we consider conjunctive queries over knowledge bases formulated in the popular DL SHIQ and allow transitive roles in both the query and the knowledge base. We show that query answering is decidable and establish the following complexity bounds: regarding combined complexity, we devise a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query. Regarding data complexity, we prove co-NP-completeness.

DOI: 10.1613/jair.2372

Extracted Key Phrases

Cite this paper

@inproceedings{Glimm2007ConjunctiveQA, title={Conjunctive Query Answering for the Description Logic SHIQ}, author={Birte Glimm and Ian Horrocks and Carsten Lutz and Ulrike Sattler}, booktitle={IJCAI}, year={2007} }