Answering Regular Path Queries Over SQ Ontologies
share
We study query answering in the description logic 𝒮𝒬 supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for 𝒮𝒬 knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.
READ FULL TEXT