RDF with regular expressions

Faisal Alkhateeb 1 Jean-François Baget 2 Jérôme Euzenat 1
2 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for querying an RDF knowledge base, some, such as SPARQL, are based on the formal semantics of RDF and the concept of consequence semantic, others, inspired by the work in data bases, uses regular expressions making it possible to search the paths in the graph associated with the knowledge base. In order to combine the expressivity of these two approaches, we define a mixed language, called PRDF (for "Paths RDF") in which the arcs of a graph can be labeled by regular expressions. We define the syntax and the semantics of these objects, and propose a correct and complete algorithm which, by a kind of homomorphism, calculates the semantic consequence between an RDF graph and a PRDF graph. This algorithm is the heart of the extension of the SPARQL query language which we propose and implemented: a PSPARQL query allows to query an RDF knowledge base using graph patterns whose predicates are regular expressions.
Document type :
Reports
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/inria-00144922
Contributor : Faisal Alkhateeb <>
Submitted on : Tuesday, May 22, 2007 - 4:36:24 PM
Last modification on : Thursday, April 4, 2019 - 5:18:22 PM
Long-term archiving on : Friday, September 24, 2010 - 10:56:20 AM

File

RR-6191.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00144922, version 4

Citation

Faisal Alkhateeb, Jean-François Baget, Jérôme Euzenat. RDF with regular expressions. [Research Report] RR-6191, INRIA. 2007. ⟨inria-00144922v4⟩

Share

Metrics

Record views

953

Files downloads

242