We study the formal analysis of mappings in ontology-based data access (OBDA). Specifically, we focus on the problem of identifying mapping inconsistency and redundancy, two of the most important anomalies for mappings in OBDA. We consider a wide range of ontology languages that comprises OWL 2 and all its profiles, and examine mapping languages of different expressiveness over relational databases. We establish tight complexity bounds for the decision problems associated with mapping inconsistency and redundancy.
(2015). Mapping analysis in ontology-based data access: Algorithms and complexity (Discussion paper) . Retrieved from http://hdl.handle.net/10446/133405
Mapping analysis in ontology-based data access: Algorithms and complexity (Discussion paper)
Savo, Domenico Fabio;
2015-01-01
Abstract
We study the formal analysis of mappings in ontology-based data access (OBDA). Specifically, we focus on the problem of identifying mapping inconsistency and redundancy, two of the most important anomalies for mappings in OBDA. We consider a wide range of ontology languages that comprises OWL 2 and all its profiles, and examine mapping languages of different expressiveness over relational databases. We establish tight complexity bounds for the decision problems associated with mapping inconsistency and redundancy.| File | Dimensione del file | Formato | |
|---|---|---|---|
|
DL-15.pdf
Solo gestori di archivio
Versione:
postprint - versione referata/accettata senza referaggio
Licenza:
Licenza default Aisberg
Dimensione del file
200.44 kB
Formato
Adobe PDF
|
200.44 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo
