Artale, A. and Calvanese, D. and Kontchakov, Roman and Zakharyaschev, M. (2007) DL-Lite in the light of first-order logic. In: UNSPECIFIED (ed.) Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. AAAI Press, pp. 361-366.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 11 May 2021 11:59 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/44214 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
