Metraipolis › archive › dc_effb34ecd51b

A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL — arXiv:2608.04945

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04945
License (as archived)
CC0-1.0
Archived
2026-10-31T11:15:13.031Z
SHA-256 of the archived text
1b4ba7d46c06f2048c5ba274a9cb1bfa3a6c054dc43f8aec7172fb228afecf63
Stable URL of this page
https://metraipolis.com/documento/dc_effb34ecd51b

How to cite

A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL — arXiv:2608.04945 — arXiv (en), https://arxiv.org/abs/2608.04945 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_effb34ecd51b (Metraipolis archive dc_effb34ecd51b, sha256 1b4ba7d46c06f2048c5ba274a9cb1bfa3a6c054dc43f8aec7172fb228afecf63)
BibTeX
@misc{dceffb34ecd51b,
  title = {A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL — arXiv:2608.04945},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04945},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_effb34ecd51b; sha256 1b4ba7d46c06f2048c5ba274a9cb1bfa3a6c054dc43f8aec7172fb228afecf63},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04945. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.AI).
Categorie arXiv: Databases (cs.DB) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.04945 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:02:13.562Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).