A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
This work introduces DL automata, a novel formalism that captures the semantics of such OMQs via runs over fact sets via runs over fact sets, and identifies 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.