In this paper we introduce the notion of mapping-based knowledge base (MKB) to formalize the situation where both the extensional and the intensional level of the ontology are determined by suitable mappings to a set of (relational) data sources. This allows for making the intensional level of the ontology as dynamic as traditionally the extensional level is. To do so, we resort to the meta-modeling capabilities of higher-order Description Logics, which allow us to see concepts and roles as individuals, and vice versa. The challenge in this setting is to design tractable query answering algorithms. Besides the definition of MKBs, our main result is that answering instance queries posed to MKBs expressed in Hi(DL-Lite ℛ) can be done efficiently. In particular, we define a query rewriting technique that produces first-order (SQL) queries to be posed to the data sources. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.
Ontology-based data access with dynamic TBoxes in DL-lite / DI PINTO, Floriana; DE GIACOMO, Giuseppe; Lenzerini, Maurizio; Rosati, Riccardo. - STAMPA. - 1:(2012), pp. 719-725. (Intervento presentato al convegno 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12 tenutosi a Toronto, ON nel 22 July 2012 through 26 July 2012).
Ontology-based data access with dynamic TBoxes in DL-lite
DI PINTO, FLORIANA;DE GIACOMO, Giuseppe;LENZERINI, Maurizio;ROSATI, Riccardo
2012
Abstract
In this paper we introduce the notion of mapping-based knowledge base (MKB) to formalize the situation where both the extensional and the intensional level of the ontology are determined by suitable mappings to a set of (relational) data sources. This allows for making the intensional level of the ontology as dynamic as traditionally the extensional level is. To do so, we resort to the meta-modeling capabilities of higher-order Description Logics, which allow us to see concepts and roles as individuals, and vice versa. The challenge in this setting is to design tractable query answering algorithms. Besides the definition of MKBs, our main result is that answering instance queries posed to MKBs expressed in Hi(DL-Lite ℛ) can be done efficiently. In particular, we define a query rewriting technique that produces first-order (SQL) queries to be posed to the data sources. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.File | Dimensione | Formato | |
---|---|---|---|
VE_2012_11573-484799.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
610.75 kB
Formato
Adobe PDF
|
610.75 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.