Answering Regular Path Queries Over SQ Ontologies

Abstract

We study query answering in the description logic $\mathcal{S}\mathcal{Q}$ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for $\mathcal{S}\mathcal{Q}$ knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.

Full Version of AAAI'18 paper