The DL-Lite Family and Relations

From MaRDI portal
Publication:3651482

DOI10.1613/JAIR.2820zbMATH Open1192.68657arXiv1401.3487OpenAlexW3101483322WikidataQ62048637 ScholiaQ62048637MaRDI QIDQ3651482FDOQ3651482

Diego Calvanese, Michael Zakharyaschev, Alessandro Artale, Roman Kontchakov

Publication date: 10 December 2009

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Abstract: The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes: by (i) adding the Boolean connectives and (ii) number restrictions to concept constructs, (iii) allowing role hierarchies, (iv) allowing role disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity constraints, and (v) adopting or dropping the unique same assumption. We analyze the combined complexity of satisfiability for the resulting logics, as well as the data complexity of instance checking and answering positive existential queries. Our approach is based on embedding DL-Lite logics in suitable fragments of the one-variable first-order logic, which provides useful insights into their properties and, in particular, computational behavior.


Full work available at URL: https://arxiv.org/abs/1401.3487






Cited In (60)


Recommendations





This page was built for publication: The DL-Lite Family and Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651482)