Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study data complexity of ansring conjunctive queries over Description Logic knowledge bases constituted by an ABox and a TBox. In particular,  are interested in characterizing the FOL-reducibility and the polynomial tractability boundaries of conjunctive query ansring, depending on the expressive por of the Description Logic used to specify the knowledge base. FOL-reducibility means that query ansring can be reduced to evaluating queries over the database corresponding to the ABox. Since first-order queries can be expressed in SQL, the importance of FOL-reducibility is that, when query ansring enjoys this property,  can take advantage of Data Base Management System (DBMS) techniques for both representing data, i.e., ABox assertions, and ansring queries via reformulation into SQL. What emerges from our complexity analysis is that the Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query ansring through standard database technology. In this sense, they are the first Description Logics specifically tailored for effective query ansring over very large ABoxes.
['Diego Calvanese', 'Giuseppe De Giacomo', 'Domenico Lembo', 'Maurizio Lenzerini', 'Riccardo Rosati']
I am writing a research paper on a idea Data complexity of query answering in description logics
[{"from": "human", "value": "I am writing a research paper on a idea Data complexity of query answering in 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:   study data complexity of ansring conjunctive queries over Description Logic knowledge bases constituted by an ABox and a TBox. In particular,  are interested in characterizing the FOL-reducibility and the polynomial tractability boundaries of conjunctive query ansring, depending on the expressive por of the Description Logic used to specify the knowledge base. FOL-reducibility means that query ansring can be reduced to evaluating queries over the database corresponding to the ABox. Since first-order queries can be expressed in SQL, the importance of FOL-reducibility is that, when query ansring enjoys this property,  can take advantage of Data Base Management System (DBMS) techniques for both representing data, i.e., ABox assertions, and ansring queries via reformulation into SQL. What emerges from our complexity analysis is that the Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query ansring through standard database technology. In this sense, they are the first Description Logics specifically tailored for effective query ansring over very large ABoxes."}]