2000 character limit reached
Answering Regular Path Queries Over SQ Ontologies (2011.08816v1)
Published 17 Nov 2020 in cs.LO and cs.AI
Abstract: We study query answering in the description logic $\mathcal{SQ}$ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for $\mathcal{SQ}$ knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.