Conjunctive Query Answering for the Description Logic SHIQ
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 399-403.
Abstract
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.
@inproceedings{ijcai2007p62,
title = {Conjunctive Query Answering for the Description Logic SHIQ},
author = {Glimm, Birte and Horrocks, Ian and Lutz, Carsten and Sattler, Ulrike},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {399--403},
year = {2007},
url = {https://ijcai.org/proceedings/2007/62},
}
TY - CPAPER TI - Conjunctive Query Answering for the Description Logic SHIQ AU - Glimm, Birte AU - Horrocks, Ian AU - Lutz, Carsten AU - Sattler, Ulrike T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 399 EP - 403 UR - https://ijcai.org/proceedings/2007/62 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
