Query Answering in Description Logics with Transitive Roles
نویسندگان
چکیده
We study the computational complexity of conjunctive query answering w.r.t. ontologies formulated in fragments of the description logic SHIQ. Our main result is the identification of two new sources of complexity: the combination of transitive roles and role hierarchies which results in 2-EXPTIMEhardness, and transitive roles alone which result in CO-NEXPTIME-hardness. These bounds complement the existing result that inverse roles make query answering in SHIQ 2-EXPTIME-hard. We also show that conjunctive query answering with transitive roles, but without inverse roles and role hierarchies, remains in EXPTIME if the ABox is tree-shaped.
منابع مشابه
Conjunctive Query Answering for Description Logics with Transitive Roles
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answering in the expressive Description Logics SHQ and SHOQ. In particular, we allow for transitive (or nonsimple) roles in the query body, which is a feature that is not supported by other existing conjunctive query answering...
متن کاملOn Query Answering in Description Logics with Number Restrictions on Transitive Roles
We study query answering in the description logic SQ supporting number restrictions on both transitive and non-transitive roles. Our main contributions are (i) a tree-like model property for SQ knowledge bases and, building upon this, (ii) an automata based decision procedure for answering two-way regular path queries, which gives a 3ExpTime upper bound.
متن کاملQuery Answering in the Description Logic S
We consider the complexity of answering conjunctive queries in the description logic S, i.e., in ALC extended with transitive roles. While a co-NExpTime lower bound was recently established in [5], the best known upper bound was 2-ExpTime. In this paper, we concentrate on the case where only a single transitive role (and no other role) is present and establish a tight co-NExpTime upper bound.
متن کاملConjunctive Query Answering for the DL SHIQ 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, conjunctive query answering over DL knowledge bases is only poorly understood if transitive roles are admitted in the query. In this paper, we consider unions of conjunctive queries over knowledge bases formulated in the prominent DL ...
متن کاملTwo Upper Bounds for Conjunctive Query Answering in SHIQ
We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NExpTime-hard if queries are connected and contain at least one answer variable [10]. In this paper, we show that, in SHIQ without inverse roles (and without transitive roles in the query), conjunctive query answering is...
متن کامل