Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Description Logics (DLs) are the formal foundations of the standard b ontology languages OWL-DL and OWL-Lite. In the Semantic b and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) sufficient expressive por of the DL to capture common data modeling constructs; (ii) ll established and flexible query mechanisms such as Conjunctive Queries (CQs); (iii) optimization of inference techniques with respect to data size, which typically dominates the size of ontologies. This calls for investigating data complexity of query ansring in expressive DLs. While the complexity of DLs has been studied extensively, data complexity has been characterized only for ansring atomic queries, and was still open for ansring CQs in expressive DLs.  tackle this issue and prove a tight CONP upper bound for the problem in SHIQ, as long as no transitive roles occur in the query.  thus establish that for a whole range of DLs from AL to SHIQ, ansring CQs with no transitive roles has CONP-complete data complexity.  obtain our result by a novel tableaux-based algorithm for checking query entailment, inspired by the one in [19], but which manages the technical challenges of simultaneous inverse roles and number restrictions (which leads to a DL lacking the finite model property).
['Magdalena Ortiz', 'Diego Calvanese', 'Thomas Eiter']
I am writing a research paper on a idea Characterizing data complexity for conjunctive query answering in expressive description logics
[{"from": "human", "value": "I am writing a research paper on a idea Characterizing data complexity for conjunctive query answering in expressive description logics"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Description Logics (DLs) are the formal foundations of the standard b ontology languages OWL-DL and OWL-Lite. In the Semantic b and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) sufficient expressive por of the DL to capture common data modeling constructs; (ii) ll established and flexible query mechanisms such as Conjunctive Queries (CQs); (iii) optimization of inference techniques with respect to data size, which typically dominates the size of ontologies. This calls for investigating data complexity of query ansring in expressive DLs. While the complexity of DLs has been studied extensively, data complexity has been characterized only for ansring atomic queries, and was still open for ansring CQs in expressive DLs.  tackle this issue and prove a tight CONP upper bound for the problem in SHIQ, as long as no transitive roles occur in the query.  thus establish that for a whole range of DLs from AL to SHIQ, ansring CQs with no transitive roles has CONP-complete data complexity.  obtain our result by a novel tableaux-based algorithm for checking query entailment, inspired by the one in [19], but which manages the technical challenges of simultaneous inverse roles and number restrictions (which leads to a DL lacking the finite model property)."}]