RDF Entailment as a Graph Homomorphism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

RDF Entailment as a Graph Homomorphism


Semantic consequence (entailment) in RDF is ususally computed using Pat Hayes Interpolation Lemma. In this paper, we reformulate this mechanism as a graph homomorphism known as projection in the conceptual graphs community. Though most of the paper is devoted to a detailed proof of this result, we discuss the immediate benefits of this reformulation: it is now easy to translate results from different communities (e.g. conceptual graphs, constraint programming,... ) to obtain new polynomial cases for the NP-complete RDF entailment problem, as well as numerous algorithmic optimizations.


Fichier principal
Vignette du fichier
baget2005a.pdf (187.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00922476 , version 1 (26-12-2013)



Jean-François Baget. RDF Entailment as a Graph Homomorphism. Proc. 4th international semantic web conference (ISWC), Nov 2005, Galway, Ireland. pp.82-96, ⟨10.1007/11574620_9⟩. ⟨hal-00922476⟩
138 View
251 Download



Gmail Facebook X LinkedIn More