RDF Entailment as a Graph Homomorphism

Jean-François Baget (1)

1 EXMO - Computer mediated exchange of structured knowledge

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

Domaines: Intelligence artificielle [cs.AI]; Web

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⟩