Abstract
In ontology-based data access, data are queried through an ontology that offers a representation of the domain of interest. In this context, correct answers are those entailed by the logical theory constituted by the data and the ontology. Traditional database constraints like tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs) are a useful tool for ontology specification. However, their interaction usually leads to intractability or undecidability of query answering; separability is the notion that captures the lack of interaction between TGDs and EGDs. In this paper we exhibit a novel and general sufficient condition for separability, in the case where the ontology is expressed with inclusion dependencies (a subclass of TGDs) and EGDs.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 5th Alberto Mendelzon International Workshop on Foundations of Data Management, Santiago, Chile, May 9-12, 2011 |
| Publisher | CEUR Workshop Proceedings (CEUR-WS.org) |
| Number of pages | 12 |
| Publication status | Published - 2011 |