Skip to Main content Skip to Navigation
Conference papers

Containment of Simple Regular Path Queries

Abstract : Testing containment of queries is a fundamental reasoning task in knowledge representation. We study here the containment problem for Conjunctive Regular Path Queries (CRPQs), a navigational query language extensively used in ontology and graph database querying. While it is known that containment of CRPQs is expspace-complete in general, we focus here on severely restricted fragments, which are known to be highly relevant in practice according to several recent studies. We obtain a detailed overview of the complexity of the containment problem, depending on the features used in the regular expressions of the queries, with completeness results for np, pitwo, pspace or expspace.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Diego Figueira Connect in order to contact the contributor
Submitted on : Friday, July 17, 2020 - 3:58:11 PM
Last modification on : Monday, December 14, 2020 - 5:58:21 PM
Long-term archiving on: : Tuesday, December 1, 2020 - 12:26:50 AM


Files produced by the author(s)


  • HAL Id : hal-02505244, version 1
  • ARXIV : 2003.04411



Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, et al.. Containment of Simple Regular Path Queries. International Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece. ⟨hal-02505244⟩



Record views


Files downloads