Answering Regular Path Queries over SQ Ontologies

Abstract

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

Text

Gutiérrez-Basulto et al. "Answering Regular Path Queries over SQ Ontologies." AAAI Conference on Artificial Intelligence, 2018. doi:10.1609/AAAI.V32I1.11539

Markdown

[Gutiérrez-Basulto et al. "Answering Regular Path Queries over SQ Ontologies." AAAI Conference on Artificial Intelligence, 2018.](https://mlanthology.org/aaai/2018/gutierrezbasulto2018aaai-answering/) doi:10.1609/AAAI.V32I1.11539

BibTeX

@inproceedings{gutierrezbasulto2018aaai-answering,
  title     = {{Answering Regular Path Queries over SQ Ontologies}},
  author    = {Gutiérrez-Basulto, Víctor and Ibáñez-García, Yazmín Angélica and Jung, Jean Christoph},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {1845-1852},
  doi       = {10.1609/AAAI.V32I1.11539},
  url       = {https://mlanthology.org/aaai/2018/gutierrezbasulto2018aaai-answering/}
}