Answering Regular Path Queries Over SQ Ontologies
V\'ictor Guti\'errez-Basulto, Yazm\'in Ib\'a\~nez-Garc\'ia, Jean, Christoph Jung
TL;DR
This paper presents an automata-based algorithm for answering regular path queries over SQ ontologies, leveraging a tree-like model property to achieve optimal complexity in 2ExpTime.
Contribution
It introduces a tree-like model property for SQ knowledge bases and an optimal automata-based method for query answering, advancing the theoretical understanding of description logic reasoning.
Findings
Automata-based algorithm operates in 2ExpTime.
Tree-like model property established for SQ knowledge bases.
Algorithm is optimal in complexity.
Abstract
We study query answering in the description logic supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · Advanced Database Systems and Queries