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 forming a DLR knowledge base (KB). We show how a simple syntactic restriction on the appearance of projections sharing common attributes in the KB 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.
Artale, A., Franconi, E., Penaloza, R., Sportelli, F. (2017). A decidable very expressive n-ary description logic for database applications. In 25th Italian Symposium on Advanced Database Systems, SEBD 2017 (pp.33-40). Sistemi Evoluti per Basi di Dati (SEBD).
A decidable very expressive n-ary description logic for database applications
Penaloza R.;
2017
Abstract
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 forming a DLR knowledge base (KB). We show how a simple syntactic restriction on the appearance of projections sharing common attributes in the KB 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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
