A Decidable Very Expressive Description Logic for Databases

author: Enrico Franconi, KRDB Research Centre for Knowledge and Data, Free University of Bozen-Bolzano
published: Nov. 28, 2017,   recorded: October 2017,   views: 869

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: