论文标题
CQE在描述逻辑中通过实例不可区分性（扩展版本）
CQE in Description Logics Through Instance Indistinguishability (extended version)
论文作者
论文摘要
我们在描述逻辑（DLS）中研究了保护隐私的查询。具体而言，我们根据实例无法区分的概念来考虑受控查询评估（CQE）的方法。我们通过与替代性的，现有的保密性保留方法进行比较，从DL-Lite $ _ {\ Mathcal {r}} $本体来得出数据复杂性结果。 Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-Lite$_{\mathcal{R}}$ ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i.e., it is always reducible to the evaluation of a first-order query over the data instance.
We study privacy-preserving query answering in Description Logics (DLs). Specifically, we consider the approach of controlled query evaluation (CQE) based on the notion of instance indistinguishability. We derive data complexity results for query answering over DL-Lite$_{\mathcal{R}}$ ontologies, through a comparison with an alternative, existing confidentiality-preserving approach to CQE. Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-Lite$_{\mathcal{R}}$ ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i.e., it is always reducible to the evaluation of a first-order query over the data instance.
