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

Abstract

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… (More)
DOI: 10.1007/s10817-007-9078-x

Topics

1 Figure or Table

Cite this paper

@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} }