# A Decidable Very Expressive Description Logic for Databases (Extended Version)

arXiv: https://arxiv.org/abs/1707.08468 · HTML: https://mlsanity.com/paper/1707.08468/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jul 2017.

## Built on by (most cited first, 1 of 1)

- [Relational Algebra and Calculus with SQL Null Values](https://mlsanity.com/paper/2202.10898/) (2022)

## Abstract (arXiv)

We introduce DLR^+, an extension of the n-ary propositionally closed description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a simple syntactic restriction on the appearance of projections sharing common attributes in a DLR^+ knowledge base makes reasoning in the language decidable with the same computational complexity as DLR. The obtained DLR^± n-ary description logic is able to encode more thoroughly conceptual data models such as EER, UML, and ORM.