New Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
A recent study in computer science has introduced a new way to convert atomic queries related to Horn-ALCHI ontologies into GQL, which is the latest ISO standard for graph query languages. The paper, titled 'A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL,' is available on arXiv. The researchers focus on ontology-mediated queries (OMQs) that combine these atomic queries with Horn-ALCHI ontologies, which often can't be rewritten in first-order logic. They present a novel concept called DL automata, which captures the meaning of OMQs through sequences over sets of facts. They also pinpoint a specific type of DL automata that can be restructured into unions of conjunctive two-way regular path queries (UC2RPQs), crucial for GQL. This approach allows for rewriting many Horn-ALCHI OMQs into GQL, improving query processing in graph databases.
Key facts
- Paper introduces a general sufficient condition for rewriting Horn-ALCHI atomic queries into GQL.
- Focuses on ontology-mediated queries (OMQs) with atomic queries over Horn-ALCHI ontologies.
- Horn-ALCHI is an expressive Description Logic not generally first-order rewritable.
- Introduces DL automata, a novel formalism capturing OMQ semantics via runs over fact sets.
- Identifies a class of DL automata rewritable into unions of conjunctive two-way regular path queries (UC2RPQs).
- UC2RPQs are a central fragment of GQL, the ISO standard graph query language.
- The class relies on stratification of automaton states, avoiding cyclic dependencies.
- Yields a broad class of Horn-ALCHI OMQs that are GQL-rewritable.
- Paper is available on arXiv under computer science databases.
- Submission history and references are included.
Entities
Institutions
- arXiv