Constrained regular expressions in SPARQL

Abstract : We have proposed an extension of SPARQL, called PSPARQL, to characterize paths of variable lengths in an RDF knowledge base (e.g. "Does there exists a trip from town A to town B?"). However, PSPARQL queries do not allow expressing constraints on internal nodes (e.g. "Moreover, one of the stops must provide a wireless access."). This paper proposes an extension of PSPARQL, called CPSPARQL, that allows expressing constraints on paths. For this extension, we provide an abstract syntax, semantics as well as a sound and complete inference mechanism for answering CPSPARQL queries.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download
Contributor : Jérôme Euzenat <>
Submitted on : Friday, February 22, 2013 - 3:06:48 PM
Last modification on : Thursday, April 4, 2019 - 5:18:02 PM
Document(s) archivé(s) le : Thursday, May 23, 2013 - 7:05:08 AM


Files produced by the author(s)


  • HAL Id : hal-00793531, version 1



Faisal Alkhateeb, Jean-François Baget, Jérôme Euzenat. Constrained regular expressions in SPARQL. International conference on semantic web and web services - SWWS 2008, Aug 2008, Las Vegas, Nevada, United States. pp.91-99. ⟨hal-00793531⟩



Record views


Files downloads