Skip to Main content Skip to Navigation
Conference papers

RDF Entailment as a Graph Homomorphism

Abstract : 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.
Mots-clés : RDF RDFS Inférence
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Jérôme Euzenat Connect in order to contact the contributor
Submitted on : Thursday, December 26, 2013 - 11:41:01 PM
Last modification on : Wednesday, April 6, 2022 - 3:48:15 PM
Long-term archiving on: : Friday, March 28, 2014 - 5:03:12 PM


Files produced by the author(s)




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⟩



Record views


Files downloads