We study query answering in the description logic SQ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for SQ knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.
Cite
@article{arxiv.2011.08816,
title = {Answering Regular Path Queries Over SQ Ontologies},
author = {Víctor Gutiérrez-Basulto and Yazmín Ibáñez-García and Jean Christoph Jung},
journal= {arXiv preprint arXiv:2011.08816},
year = {2020}
}