DMCA
DL-Lite: Tractable description logics for ontologies (2005)
Cached
Download Links
| Venue: | In Proc. of AAAI 2005 |
| Citations: | 210 - 49 self |
BibTeX
@INPROCEEDINGS{Calvanese05dl-lite:tractable,
author = {Diego Calvanese and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
title = {DL-Lite: Tractable description logics for ontologies},
booktitle = {In Proc. of AAAI 2005},
year = {2005},
pages = {602--607}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, but also answering complex queries (in particular, conjunctive queries) over the set of instances maintained in secondary storage. We show that in DL-Lite the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynomial in the size of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial data complexity for query answering over DL knowledge bases. A notable feature of our logic is to allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring TBox reasoning is independent of the ABox, and the part of the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimization strategies provided by current DBMSs.
Keyphrases
tractable description logic query answering sql engine secondary storage query evaluation whole knowledge base query optimization strategy conjunctive query complex query data complexity tbox reasoning current dbms dl knowledge base basic ontology language polynomial data complexity usual dl reasoning task new description logic low complexity first result notable feature
