Answering Regular Path Queries Over SQ Ontologies

Gutiérrez-Basulto, Víctor, Ibáñez-García, Yazmín, Jung, Jean Christoph

arXiv.org Artificial Intelligence 

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.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found