Skip to Main content Skip to Navigation
Journal articles

Constrained regular expressions for answering RDF-path queries modulo RDFS

Faisal Alkhateeb 1 Jérôme Euzenat 2
2 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Several extensions of SPARQL to RDFS semantics have been proposed. In this paper, we discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics. In particular, we present and compare nSPARQL and our proposal CPSPARQL. We show that CPSPARQL is expressive enough to answer full SPARQL queries modulo RDFS. Finally, we compare the expressiveness and complexity of both nSPARQL and the corresponding frag- ment of CPSPARQL, that we call cpSPARQL. We show that both languages have the same complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is more expressive than nSPARQL.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Jérôme Euzenat <>
Submitted on : Tuesday, April 8, 2014 - 12:43:05 PM
Last modification on : Tuesday, February 9, 2021 - 3:02:04 PM
Long-term archiving on: : Tuesday, July 8, 2014 - 11:45:53 AM


Files produced by the author(s)




Faisal Alkhateeb, Jérôme Euzenat. Constrained regular expressions for answering RDF-path queries modulo RDFS. International Journal of Web Information Systems, Emerald Publishing Limited, 2014, 10 (1), pp.24-50. ⟨10.1108/IJWIS-05-2013-0013⟩. ⟨hal-00975283⟩