提出可被GQL重写的逻辑查询条件，扩展了语义网查询能力。
A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
- 用DL自动机刻画霍恩-ALCHI本体上的原子查询语义。
- 识别出可重写为GQL核心语法的自动机类，支持递归路径查询。
- 适用于需处理复杂本体但又要求高效执行的语义查询场景。
GQL作为国际标准查询语言，扩展了一阶逻辑并引入可控递归，推动其在本体媒介查询（OMQ）中的应用。本文聚焦于基于霍恩-ALCHI描述逻辑的原子查询，该逻辑一般不可一阶重写。为此，我们引入DL自动机形式化，通过事实集上的运行捕捉此类查询的语义。进而识别出一类可重写为并联合二阶正则路径查询（UC2RPQs）的大型自动机类，这是GQL的核心片段。该类自动机依赖状态分层机制，排除导致复杂度上升的特定循环依赖。由此得出一大类霍恩-ALCHI OMQs具备GQL可重写性。
原文摘要 · Abstract (English)
The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs). We focus on OMQs consisting of atomic queries over ontologies expressed in Horn-ALCHI, an expressive Description Logic that is not, in general, first-order rewritable. To address this, we introduce DL automata, a novel formalism that captures the semantics of such OMQs via runs over fact sets. We then identify a large class of DL automata that can be rewritten into unions of conjunctive two-way regular path queries (UC2RPQs), a central fragment of GQL. Our class of automata relies on a stratification of their states, ruling out specific forms of cyclic dependencies known to raise the complexity. This yields a broad class of Horn-ALCHI OMQs that are GQL-rewritable.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。