Pushing the Limits of Reasoning over Ontologies with Hidden Content

KR(2010)

引用 24|浏览23
暂无评分
摘要
There is currently a growing interest in techniques for hidi ng 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 accessi- ble through a limited query interface. If Kv reuses the sym- bols from Kh in a certain restricted way, one can reason over Kv ∪ 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 expres- sivity limitations; we present several novel reasoning alg o- rithms; and we outline the limitations of the new framework.
更多
查看译文
关键词
ontologies,description logics,semantic web,knowledge representation and reasoning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要