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.
| Original language | English |
|---|---|
| Title of host publication | IJCAI International Joint Conference on Artificial Intelligence|IJCAI Int. Joint Conf. Artif. Intell. |
| Pages | 399-404 |
| Number of pages | 5 |
| Publication status | Published - 2007 |
| Event | 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 - Hyderabad Duration: 1 Jul 2007 → … |
Conference
| Conference | 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 |
|---|---|
| City | Hyderabad |
| Period | 1/07/07 → … |