Towards more expressive ontology languages: The query answering problem.
Ontology reasoning finds a relevant application in the so-called ontology-based data access, where a classical extensional database (EDB) is enhanced by an ontology, in the form of logical assertions, that generates new intensional knowledge which contributes to answering queries. In this setting, q...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
2012
|
| _version_ | 1826307380091027456 |
|---|---|
| author | Calì, A Gottlob, G Pieris, A |
| author_facet | Calì, A Gottlob, G Pieris, A |
| author_sort | Calì, A |
| collection | OXFORD |
| description | Ontology reasoning finds a relevant application in the so-called ontology-based data access, where a classical extensional database (EDB) is enhanced by an ontology, in the form of logical assertions, that generates new intensional knowledge which contributes to answering queries. In this setting, queries are therefore answered against a logical theory constituted by the EDB and the ontology; more specifically, query answering amounts to computing the answers to the query that are entailed by the EDB and the ontology. In this paper, we study novel relevant classes of ontological theories for which query answering is both decidable and of tractable data complexity, that is, the complexity with respect to the size of the data only. In particular, our new classes belong to the recently introduced family of Datalog-based languages, called Datalog ±. The basic Datalog ± rules are (function-free) Horn rules extended with existential quantification in the head, known as tuple-generating dependencies (TGDs). We propose the language of sticky sets of TGDs (or sticky Datalog ±), which are sets of TGDs with a restriction on multiple occurrences of variables in the rule-bodies. We establish complexity results for answering conjunctive queries under sticky sets of TGDs, showing, in particular, that queries can be compiled into domain independent first-order (and thus translatable into SQL) queries over the given EDB. We also present several extensions of sticky sets of TGDs, and investigate the complexity of query answering under such classes. In summary, we obtain highly expressive and effective ontology languages that unify and generalize both classical database constraints, and important features of the most widespread tractable description logics; in particular, the DL-Lite family of description logics. © 2012 Elsevier B.V. |
| first_indexed | 2024-03-07T07:02:14Z |
| format | Journal article |
| id | oxford-uuid:ffe40c05-dc55-46ea-937e-1bfcfe05b1c0 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T07:02:14Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | oxford-uuid:ffe40c05-dc55-46ea-937e-1bfcfe05b1c02022-03-27T13:48:26ZTowards more expressive ontology languages: The query answering problem.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:ffe40c05-dc55-46ea-937e-1bfcfe05b1c0Symplectic Elements at Oxford2012Calì, AGottlob, GPieris, AOntology reasoning finds a relevant application in the so-called ontology-based data access, where a classical extensional database (EDB) is enhanced by an ontology, in the form of logical assertions, that generates new intensional knowledge which contributes to answering queries. In this setting, queries are therefore answered against a logical theory constituted by the EDB and the ontology; more specifically, query answering amounts to computing the answers to the query that are entailed by the EDB and the ontology. In this paper, we study novel relevant classes of ontological theories for which query answering is both decidable and of tractable data complexity, that is, the complexity with respect to the size of the data only. In particular, our new classes belong to the recently introduced family of Datalog-based languages, called Datalog ±. The basic Datalog ± rules are (function-free) Horn rules extended with existential quantification in the head, known as tuple-generating dependencies (TGDs). We propose the language of sticky sets of TGDs (or sticky Datalog ±), which are sets of TGDs with a restriction on multiple occurrences of variables in the rule-bodies. We establish complexity results for answering conjunctive queries under sticky sets of TGDs, showing, in particular, that queries can be compiled into domain independent first-order (and thus translatable into SQL) queries over the given EDB. We also present several extensions of sticky sets of TGDs, and investigate the complexity of query answering under such classes. In summary, we obtain highly expressive and effective ontology languages that unify and generalize both classical database constraints, and important features of the most widespread tractable description logics; in particular, the DL-Lite family of description logics. © 2012 Elsevier B.V. |
| spellingShingle | Calì, A Gottlob, G Pieris, A Towards more expressive ontology languages: The query answering problem. |
| title | Towards more expressive ontology languages: The query answering problem. |
| title_full | Towards more expressive ontology languages: The query answering problem. |
| title_fullStr | Towards more expressive ontology languages: The query answering problem. |
| title_full_unstemmed | Towards more expressive ontology languages: The query answering problem. |
| title_short | Towards more expressive ontology languages: The query answering problem. |
| title_sort | towards more expressive ontology languages the query answering problem |
| work_keys_str_mv | AT calia towardsmoreexpressiveontologylanguagesthequeryansweringproblem AT gottlobg towardsmoreexpressiveontologylanguagesthequeryansweringproblem AT pierisa towardsmoreexpressiveontologylanguagesthequeryansweringproblem |