发表机构
Sapienza University of Rome（罗马第一大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究 DL 本体中基于认知依赖的保密策略下的可处理查询回答。针对现有问题，引入基于最小策略违反的新 CQE 语义，证明其在 $\text{DL-Lite}_{\mathcal{R}}$ 本体中数据复杂度可多项式时间判定，并给出软件实现评估可行性。
AI 中文摘要
我们在描述逻辑（DL）本体的背景下研究受控查询评估（CQE），这是一种用于保密数据访问的声明性方法，针对通过认知依赖（ED）表达的保密策略。首先解决了在已知的 CQE 语义（GA - 和 IGA - 蕴含）下回答查询（具体为合取查询的布尔并集）的问题。结果表明，若 TBox 用 $\text{DL-Lite}_{\mathcal{R}}$ 表达，CQE 通常计算上难以处理。此外，在存在 ED 的情况下，IGA 语义最近被证明不满足称为不可区分性的重要保密属性。为定义计算上更简单且保密的 CQE 形式，我们基于最小策略违反（MPV）概念引入了一种新的 CQE 语义。新语义提供了对先前语义的合理近似，同时满足不可区分性属性。还证明了在 $\text{DL-Lite}_{\mathcal{R}}$ 本体的情况下，MPV 语义下的查询蕴含在数据复杂度上可在多项式时间内判定。最后，展示了我们框架的软件实现，用于使用现有的 OWL 2 QL 基准评估这种新方法的可行性。
英文摘要
We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confidentiality policies expressed through Epistemic Dependencies (EDs). We first address the problem of answering queries (specifically, Boolean unions of conjunctive queries) under known semantics for CQE (GA- and IGA-entailment). Our results show that if the TBox is expressed in $\text{DL-Lite}_{\mathcal{R}}$, CQE is computationally intractable in general. Moreover, in the presence of EDs, the IGA semantics has recently been proven not to satisfy an important confidentiality preservation property known as indistinguishability. With the goal of defining computationally easier and confidentiality-preserving forms of CQE, we introduce a new semantics for CQE, based on the notion of minimal policy violation (MPV). We show that the new semantics provides a sound approximation of the previous ones, while satisfying the indistinguishability property. We also prove that, in the case of $\text{DL-Lite}_{\mathcal{R}}$ ontologies, query entailment under the MPV semantics can be decided in polynomial time in data complexity. Finally, we present a software implementation of our framework that we used to evaluate the feasibility of this new approach using an existing benchmark for OWL 2 QL.
CommentsAccepted at ISWC 2026
