Add to ORKGWe study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from ExpTime via NExpTime to 2ExpTime, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) ...
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL an...
AbstractIn this paper we study data complexity of answering conjunctive queries over description log...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering...
In ontology-mediated querying with an expressive description logic L, two desirable properties of a ...
We study the following question: if τ is a TBox that is formulated in an expressive DL L and all CQs...
This paper investigates the impact of query topology on the difficulty of answering conjunctive quer...
Abstract. We consider the problems of conjunctive query answering and rewriting under Description Lo...
We study conjunctive query answering and first-order rewritability of conjunctive queries for binary...
Our concern is the problem of determining the data complexity of answering an ontology-mediated quer...
We investigate the succinctness problem for conjunctive query rewritings over OWL2QL ontologies of d...
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive...
We consider the problem of answering conjunctive queries over description logic knowledge bases via ...
In this paper we study data complexity of answering conjunctive queries over description logic (DL) ...
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) ...
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL an...
AbstractIn this paper we study data complexity of answering conjunctive queries over description log...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering...
In ontology-mediated querying with an expressive description logic L, two desirable properties of a ...
We study the following question: if τ is a TBox that is formulated in an expressive DL L and all CQs...
This paper investigates the impact of query topology on the difficulty of answering conjunctive quer...
Abstract. We consider the problems of conjunctive query answering and rewriting under Description Lo...
We study conjunctive query answering and first-order rewritability of conjunctive queries for binary...
Our concern is the problem of determining the data complexity of answering an ontology-mediated quer...
We investigate the succinctness problem for conjunctive query rewritings over OWL2QL ontologies of d...
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive...
We consider the problem of answering conjunctive queries over description logic knowledge bases via ...
In this paper we study data complexity of answering conjunctive queries over description logic (DL) ...
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) ...
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL an...
AbstractIn this paper we study data complexity of answering conjunctive queries over description log...