Add to ORKGWe study the data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FO-rewritability and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the DL used to express the knowledge base. What emerges from our complexity analysis is that the Description Logics of the DL-Lite family are essentially the maximal logics allowing for conjunctive query answering through standard database technology
Abstract. We consider the problems of conjunctive query answering and rewriting for information inte...
We consider the problems of conjunctive query answering and rewriting for information integration sy...
AbstractData in description logic knowledge bases is stored in the form of an ABox. ABoxes are often...
We study the data complexity of answering con-junctive queries over Description Logic knowledge base...
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) ...
AbstractIn this paper we study data complexity of answering conjunctive queries over description log...
We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to captur...
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL an...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We consider the problem of answering conjunctive queries over description logic knowledge bases via ...
Answering queries over an incomplete database w.r.t. a set of constraints is an important computatio...
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology ...
Abstract. We consider the problems of conjunctive query answering and rewriting under Description Lo...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
Abstract. We consider the problems of conjunctive query answering and rewriting for information inte...
We consider the problems of conjunctive query answering and rewriting for information integration sy...
AbstractData in description logic knowledge bases is stored in the form of an ABox. ABoxes are often...
We study the data complexity of answering con-junctive queries over Description Logic knowledge base...
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) ...
AbstractIn this paper we study data complexity of answering conjunctive queries over description log...
We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to captur...
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL an...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We consider the problem of answering conjunctive queries over description logic knowledge bases via ...
Answering queries over an incomplete database w.r.t. a set of constraints is an important computatio...
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology ...
Abstract. We consider the problems of conjunctive query answering and rewriting under Description Lo...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
Abstract. We consider the problems of conjunctive query answering and rewriting for information inte...
We consider the problems of conjunctive query answering and rewriting for information integration sy...
AbstractData in description logic knowledge bases is stored in the form of an ABox. ABoxes are often...