# Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

@article{Calvanese2007TractableRA,
title={Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family},
author={Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
journal={Journal of Automated Reasoning},
year={2007},
volume={39},
pages={385-429}
}
We propose a new family of description logics (DLs), 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, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DL-Lite family, the usual DL… Expand
1,433 Citations
Query Answering over Description Logic Ontologies
This work overviews here some of the key techniques developed in the last years for query answering over DL ontologies, ranging from rewriting based approaches for lightweight DLs, to tableaux algorithms, and techniques based on automata on infinite trees for very expressive DLs. Expand
Improving Query Answering over DL-Lite Ontologies
• Computer Science
• KR
• 2010
Presto is presented, a new query answering technique for DL-Lite ontologies, and an experimental comparison of Presto with the main previous approaches to query answering in DL- Lite shows that it is significantly more efficient. Expand
Data Complexity of Query Answering in Description Logics
• Computer Science, Mathematics
• Description Logics
• 2005
The Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query answering through standard database technology, and are the first description Logics specifically tailored for effective query answering over very large ABoxes. Expand
Temporal Conjunctive Query Answering in the Extended DL-Lite Family
• Computer Science
• ArXiv
• 2020
This work investigates temporal conjunctive queries (TCQs) that allow to access temporal data through classical ontologies and studies combined and data complexity of TCQ entailment for ontologies written in description logics from the extended DL-Lite family. Expand
Consistent Query Answering over Description Logic Ontologies
• Computer Science
• Description Logics
• 2007
This paper provides inconsistency tolerant semantics for DLs, and studies the computational complexity of consistent query answering over ontologies specified in DL-Lite, a family of DLs specifically tailored to deal with large amounts of data. Expand
Explanation in the DL-LiteFamily of Description Logics
• Computer Science
• OTM Conferences
• 2008
This paper describes reasoning in DL - Lite, a family of DLs that provide an optimal tradeoff between expressive power and computational complexity of reasoning, and provides explanation for reasoning in finite models in this context. Expand
Tractable query answering for description logics via query rewriting
RQR is presented—a novel resolution-based rewriting algorithm for the description logic ELHIO¬ that generalizes and extends existing approaches and is worst-case optimal with respect to data complexity for all of these logics. Expand
Answering Counting Queries over DL-Lite Ontologies (Extended Abstract)
• Computer Science
• Description Logics
• 2020
Recent contributions include the definition of a more general form of counting conjunctive query (CCQ), a detailed study of the data and combined complexity of CCQ answering over DL-Litecore and DL- liteR knowledge bases under various restrictions on the TBox and query, and the precise data complexity of identifying the best certain interval. Expand
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
• Computer Science
• Journal of Automated Reasoning
• 2008
It is established that, for a whole range of sublogics of $\mathcal{SHOIQ}$ that contain $\Mathcal{AL}$, answering such queries has coNP-complete data complexity, and a tight coNP upper bound for positive existential queries without transitive roles is proved. Expand
Querying OWL 2 QL and Non-monotonic Rules
• Computer Science
• SEMWEB
• 2011
This paper presents a top-down procedure for querying knowledge bases (KB) that combine non-monotonic rules with an ontology in DL-LiteR - the DL underlying the OWL 2 profile OWL2 QL, and aims particularly at answering queries in an efficient way for KB with large ABoxes. Expand

#### References

SHOWING 1-10 OF 35 REFERENCES
DL-Lite: Tractable Description Logics for Ontologies
• Computer Science
• AAAI
• 2005
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
• Computer Science
• AAAI
• 2006
For a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity, established by a novel tableaux-based algorithm for checking query entailment. Expand
Data Complexity of Query Answering in Description Logics
• Computer Science, Mathematics
• Description Logics
• 2005
The Description Logics of the DL-Lite family are the maximal logics allowing conjunctive query answering through standard database technology, and are the first description Logics specifically tailored for effective query answering over very large ABoxes. Expand
On the Update of Description Logic Ontologies at the Instance Level
• Computer Science
• AAAI
• 2006
This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox. Expand
Answering Queries Using Views over Description Logics Knowledge Bases
• Computer Science
• AAAI/IAAI
• 2000
This paper addresses answering queries using views in a setting where intensional knowledge about the domain is represented using a very expressive Description Logic equipped with n-ary relations, and queries are nonrecursive datalog queries whose predicates are the concepts and relations that appear in the Description Logic knowledge base. Expand
QuOnto: Querying Ontologies
The need of efficient reasoning algorithms is of paramount importance when the ontology system is to manage large amount of objects, as in the case of several important applications where the use of ontologies is advocated nowadays. Expand
Description logic programs: combining logic programs with description logic
• Computer Science
• WWW '03
• 2003
It is shown how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules and ontologies and define a new intermediate knowledge representation contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL). Expand
Combining Horn Rules and Description Logics in CARIN
• Mathematics, Computer Science
• Artif. Intell.
• 1998
It is shown that in general, the reasoning problem for recursive carin - A LCNR knowledge bases is undecidable, and the constructors of ALCNR causing the undecidability is identified. Expand
AL-log: Integrating Datalog and Description Logics
• Computer Science
• Journal of Intelligent Information Systems
• 2004
A method for query answering in AL-log based on constrained resolution, where the usual deduction procedure defined for Datalog is integrated with a method for reasoning on the structural knowledge. Expand
Linking Data to Ontologies: The Description Logic DL-Lite_A
• Computer Science
• OWLED
• 2006
This paper proposes one such a fragment of OWL, in fact the largest fragment currently known to satisfy the above requirements, and proposes a suitable ontology-based data access model for relational DBMSs. Expand