DL-Lite: Tractable Description Logics for Ontologies: A Survey

Abstract

Description Logic, called DL-Lite, specially used to capture essential ontology languages, and keeping low difficulty of logic. Here logic means computing subsumption between concepts, and checking satisfiability of the whole knowledge base, as well as answer complex queries over the set of instances maintained in secondary storage. DL-Lite the usual DL logical tasks are polynomial in the amount of the TBox, and query answering is polynomial in the amount of the ABox (i.e., in data difficulty). To the best of knowledge, this is the first result of polynomial data difficulty for query answering over DL knowledge bases. A distinguished visage of logic is to allow for a partitions between TBox and ABox logic during query evaluation: the part of the process requiring TBox logic is self-determining of the ABox, and the some part of the process requiring access to the ABox which can be carried out by an SQL engine, thus taking benefit of the query optimization strategies provided by current DBMSs.