We investigate on the possibility of transforming concepts in Description Logics into relational databases and queries in such a way that subsumption between the original concepts can be decided as query answering over a database. For the positive results, we show a translation of ${\cal ALN}$-concepts into pairs (database, query) such that, in order to decide Subsumption $C \sqsubseteq D$ one evaluates the query resulting from the translation of D over the database resulting from C. For the negative results, we show that no compilation is possible for expressive Description Logics.
Compiling Subsumption to Relational Databases / Eufemia, Tinelli; Francesco M., Donini; DI SCIASCIO, Eugenio. - In: INTELLIGENZA ARTIFICIALE. - ISSN 1724-8035. - 7:1(2013), pp. 19-29. [10.3233/IA-130044]
Compiling Subsumption to Relational Databases
DI SCIASCIO, Eugenio
2013-01-01
Abstract
We investigate on the possibility of transforming concepts in Description Logics into relational databases and queries in such a way that subsumption between the original concepts can be decided as query answering over a database. For the positive results, we show a translation of ${\cal ALN}$-concepts into pairs (database, query) such that, in order to decide Subsumption $C \sqsubseteq D$ one evaluates the query resulting from the translation of D over the database resulting from C. For the negative results, we show that no compilation is possible for expressive Description Logics.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
