Pushing the Limits of Reasoning over Ontologies with Hidden Content

摘要

There is currently a growing interest in techniques for hiding parts of the signature of an ontology K_h that is being reused by another ontology K_v. Towards this goal, Cuenca Grau, Motik, and Kazakov (2009) recently proposed the import-by-query framework, which makes the content of K_h, accessible through a limited query interface. If K_v reuses the symbols from K_h in a certain restricted way, one can reason over K_v U K_h by accessing only K_v 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.