Containment of Simple Regular Path Queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Containment of Simple Regular Path Queries

Résumé

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.
Fichier principal
Vignette du fichier
master.pdf (325.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02505244 , version 1 (17-07-2020)

Identifiants

Citer

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⟩

Collections

CNRS ANR
116 Consultations
145 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More