Abstract
An ontology language for ontology mediated query answering (OMQA-language) is universal for a family of OMQAlanguages if it is the most expressive one among this family. In this paper, we focus on three families of tractable OMQAlanguages, including first-order rewritable languages and languages whose data complexity of the query answering is in AC0 or PTIME. On the negative side, we prove that there is, in general, no universal language for each of these families of languages. On the positive side, we propose a novel property, the locality, to approximate the first-order rewritability, and show that there exists a language of disjunctive embedded dependencies that is universal for the family of OMQAlanguages with locality. All of these results apply to OMQA with query languages such as conjunctive queries, unions of conjunctive queries and acyclic conjunctive queries.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, New York, New York, USA, February 7-12, 2020 |
| Publisher | Association for the Advancement of Artificial Intelligence |
| Pages | 3049-3056 |
| Number of pages | 8 |
| ISBN (Print) | 9781577358350 |
| Publication status | Published - 2020 |
| Event | AAAI Conference on Artificial Intelligence - , United States Duration: 1 Jan 1980 → … |
Publication series
| Name | |
|---|---|
| ISSN (Print) | 2159-5399 |
Conference
| Conference | AAAI Conference on Artificial Intelligence |
|---|---|
| Country/Territory | United States |
| Period | 1/01/80 → … |
Bibliographical note
Publisher Copyright:Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.