Import-by-query: ontology reasoning under access limitations

Authors:
Bernardo Cuenca Grau;Boris Motik;Yevgeny Kazakov
Affiliations:
Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 9
Cited 1

Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Complexity of the Two-Variable Fragment with Counting Quantifiers

Journal of Logic, Language and Information
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Fusions of description logics and abstract description systems

Journal of Artificial Intelligence Research
Modular reuse of ontologies: theory and practice

Journal of Artificial Intelligence Research
Conservative extensions in expressive description logics

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

To enable ontology reuse, the Web Ontology Language (OWL) allows an ontology κv to import an ontology κh. To reason with such a κv, a reasoner needs physical access to the axioms of κh. For copyright and/or privacy reasons, however, the authors of κh might not want to publish the axioms of κh; instead, they might prefer to provide an oracle that can answer a (limited) set of queries over κh, thus allowing κv to import κh "by query." In this paper, we study import-by-query algorithms, which can answer questions about κv ∪ κh by accessing only κv and the oracle. We show that no such algorithm exists in general, and present restrictions under which importing by query becomes feasible.