There is currently a growing interest in techniques for hiding parts
of the signature of an ontology Kh that is being reused by another
ontology Kv. Towards this goal, Cuenca Grau, Motik, and Kazakov (2009)
recently proposed the import-by-query framework, which makes the
content of Kh accessible through a limited query interface. If Kv
reuses the symbols from Kh in a certain restricted way, one can reason
over Kv U Kh by accessing only Kv and the query interface. In this
paper, we map out the landscape of the import-by-query problem. We
show that certain restrictions of our original framework are strictly
necessary to make reasoning possible, we propose extensions that
overcome some of the expressivity limitations, we present several
novel reasoning algorithms, and we outline the limitations of the
new framework.
%0 Journal Article
%1 Grau2010
%A Grau, Bernardo Cuenca
%A Motik, Boris
%D 2010
%K description_logics
%T Pushing the Limits of Reasoning over Ontologies with Hidden Content
%U http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1244
%X There is currently a growing interest in techniques for hiding parts
of the signature of an ontology Kh that is being reused by another
ontology Kv. Towards this goal, Cuenca Grau, Motik, and Kazakov (2009)
recently proposed the import-by-query framework, which makes the
content of Kh accessible through a limited query interface. If Kv
reuses the symbols from Kh in a certain restricted way, one can reason
over Kv U Kh by accessing only Kv and the query interface. In this
paper, we map out the landscape of the import-by-query problem. We
show that certain restrictions of our original framework are strictly
necessary to make reasoning possible, we propose extensions that
overcome some of the expressivity limitations, we present several
novel reasoning algorithms, and we outline the limitations of the
new framework.
@article{Grau2010,
abstract = {There is currently a growing interest in techniques for hiding parts
of the signature of an ontology Kh that is being reused by another
ontology Kv. Towards this goal, Cuenca Grau, Motik, and Kazakov (2009)
recently proposed the import-by-query framework, which makes the
content of Kh accessible through a limited query interface. If Kv
reuses the symbols from Kh in a certain restricted way, one can reason
over Kv U Kh by accessing only Kv and the query interface. In this
paper, we map out the landscape of the import-by-query problem. We
show that certain restrictions of our original framework are strictly
necessary to make reasoning possible, we propose extensions that
overcome some of the expressivity limitations, we present several
novel reasoning algorithms, and we outline the limitations of the
new framework.},
added-at = {2011-08-09T16:33:51.000+0200},
author = {Grau, Bernardo Cuenca and Motik, Boris},
biburl = {https://www.bibsonomy.org/bibtex/200e2f5c1c192137331b883b8756dc6ba/reynares.e},
conference = {Knowledge Representation and Reasoning Conference},
interhash = {7b302514ae3df357408763e771f4211a},
intrahash = {00e2f5c1c192137331b883b8756dc6ba},
keywords = {description_logics},
timestamp = {2013-05-17T20:39:55.000+0200},
title = {Pushing the Limits of Reasoning over Ontologies with Hidden Content},
url = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1244},
year = 2010
}