M. Lenzerini, L. Lepore, and A. Poggi. Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, page 1174--1180. (2016)
Abstract
Hi(OWL 2 QL) is a new ontology language with the OWL2QL syntax and a specific semantics designed to support metamodeling and meta-querying. In this paper we investigate the problem of answering metaqueries in Hi(OWL 2 QL), which are unions of conjunctive queries with both ABox and TBox atoms. We first focus on a specific class of ontologies, called TBox-complete, where there is no uncertainty about TBox axioms, and show that query answering in this case has the same complexity (both data and combined) as in OWL2QL. We then move to general ontologies and show that answering metaqueries is coNP-complete with respect to ontology complexity, Π2p-complete with respect to combined complexity, and remains AC0 with respect to ABox complexity. Finally, we present an optimized query answering algorithm that can be used for TBox-complete ontologies.
%0 Conference Paper
%1 LLP-IJCA-P-16
%A Lenzerini, Maurizio
%A Lepore, Lorenzo
%A Poggi, Antonella
%B Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016
%D 2016
%K optique-project
%P 1174--1180
%T Answering Metaqueries over Hi OWL 2 QL Ontologies
%X Hi(OWL 2 QL) is a new ontology language with the OWL2QL syntax and a specific semantics designed to support metamodeling and meta-querying. In this paper we investigate the problem of answering metaqueries in Hi(OWL 2 QL), which are unions of conjunctive queries with both ABox and TBox atoms. We first focus on a specific class of ontologies, called TBox-complete, where there is no uncertainty about TBox axioms, and show that query answering in this case has the same complexity (both data and combined) as in OWL2QL. We then move to general ontologies and show that answering metaqueries is coNP-complete with respect to ontology complexity, Π2p-complete with respect to combined complexity, and remains AC0 with respect to ABox complexity. Finally, we present an optimized query answering algorithm that can be used for TBox-complete ontologies.
@inproceedings{LLP-IJCA-P-16,
abstract = {Hi(OWL 2 QL) is a new ontology language with the OWL2QL syntax and a specific semantics designed to support metamodeling and meta-querying. In this paper we investigate the problem of answering metaqueries in Hi(OWL 2 QL), which are unions of conjunctive queries with both ABox and TBox atoms. We first focus on a specific class of ontologies, called TBox-complete, where there is no uncertainty about TBox axioms, and show that query answering in this case has the same complexity (both data and combined) as in OWL2QL. We then move to general ontologies and show that answering metaqueries is coNP-complete with respect to ontology complexity, Π2p-complete with respect to combined complexity, and remains AC0 with respect to ABox complexity. Finally, we present an optimized query answering algorithm that can be used for TBox-complete ontologies.},
added-at = {2016-10-24T11:58:14.000+0200},
audience = {academic},
author = {Lenzerini, Maurizio and Lepore, Lorenzo and Poggi, Antonella},
biburl = {https://www.bibsonomy.org/bibtex/2e7c3ab833738ad71fa0dc20909dc7ce1/savo.fabio},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July 2016},
interhash = {559fa2be8c63df63213de0293c628b0d},
intrahash = {e7c3ab833738ad71fa0dc20909dc7ce1},
keywords = {optique-project},
openaccess = {Yes},
pages = {1174--1180},
partneroptique = {UNIROMA1},
timestamp = {2016-12-01T17:34:21.000+0100},
title = {Answering Metaqueries over Hi OWL 2 QL Ontologies},
wpoptique = {WP4},
year = 2016,
yearoptique = {Y4}
}