Show simple item record

dc.contributor.authorArtale A
dc.contributor.authorFranconi E
dc.contributor.authorPenaloza R
dc.contributor.authorSportelli F
dc.contributor.editord'Amato C
dc.contributor.editorFernandez M
dc.contributor.editorTamma V
dc.contributor.editorLecue F
dc.contributor.editorCudré-Mauroux P
dc.contributor.editorSequeda J
dc.contributor.editorLange C
dc.contributor.editorHeflin J
dc.description.abstractWe 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.en_US
dc.relation.ispartofseriesLecture Notes in Artificial Intelligence;
dc.titleA decidable very expressive description logic for databasesen_US
dc.typeBook chapteren_US
dc.publication.titleThe Semantic Web – ISWC 2017: 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record