RDF Entailment as a Graph HomomorphismReportar como inadecuado

RDF Entailment as a Graph Homomorphism - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 EXMO - Computer mediated exchange of structured knowledge Inria Grenoble - Rhône-Alpes

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

Autor: Jean-François Baget -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados