The DL-lite family and relations

  • Authors:

  • Alessandro Artale;Diego Calvanese;Roman Kontchakov;Michael Zakharyaschev

  • Affiliations:

  • KRDB Research Centre, Free University of Bozen-Bolzano, Bolzano, Italy;KRDB Research Centre, Free University of Bozen-Bolzano, Bolzano, Italy;Department of Computer Science and Information Systems, Birkbeck College, London, U.K.;Department of Computer Science and Information Systems, Birkbeck College, London, U.K.

  • Venue:
  • Journal of Artificial Intelligence Research
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 name 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.