The DL-Lite Family and Relations

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.

Cited by in corpus (8)

• A Polynomial Time Subsumption Algorithm for Nominal Safe ${\mathcal{E}\mathcal{L}\mathcal{O}}_{\perp }$ under Rational Closure
• First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
• Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
• Accurate and Efficient Profile Matching in Knowledge Bases
• Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries
• Fuzzy OWL-BOOST: Learning Fuzzy Concept Inclusions via Real-Valued Boosting
• Deciding boundedness of monadic sirups
• Backwards State-space Reduction for Planning in Dynamic Knowledge Bases