Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large amounts of data, is posing challenging requirements w.r.t. a trade-off between expressive power of a DL and efficiency of reasoning. The logics of the DL-Lite family were specifically designed to meet such requirements and optimized w.r.t. the data complexity of answering complex types of queries. In this paper we propose DL-Lite-bool, an extension of DL-Lite with full Booleans and number restrictions, and study the complexity of reasoning in DL-Lite-bool and its significant sub-logics. We obtain our results, together with useful insights into the properties of the studied logics, by a novel reduction to the one-variable fragment of first-order logic. We study the computational complexity of satisfiability and subsumption, and the data complexity of answering positive existential queries (which extend unions of conjunctive queries). Notably, we extend the LogSpace upper bound for the data comlexity of answering unions of conjunctive queries in DL-Lite to positive queries and to the possibility of expressing also number restrictions, and hence local functionality in the TBox.
Subjects: 11.1 Description Logics; 11. Knowledge Representation
Submitted: Apr 23, 2007