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
Type de document :
Communication dans un congrès
Yolanda Gil, Enrico Motta, Richard Benjamins and Mark Musen. Proc. 4th international semantic web conference (ISWC), Nov 2005, Galway, Ireland. Springer Verlag, 3729, pp.82-96, 2005, Lecture notes in computer science. 〈10.1007/11574620_9〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00922476
Contributeur : Jérôme Euzenat <>
Soumis le : jeudi 26 décembre 2013 - 23:41:01
Dernière modification le : mercredi 11 avril 2018 - 01:55:46
Document(s) archivé(s) le : vendredi 28 mars 2014 - 17:03:12

Fichier

baget2005a.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jean-François Baget. RDF Entailment as a Graph Homomorphism. Yolanda Gil, Enrico Motta, Richard Benjamins and Mark Musen. Proc. 4th international semantic web conference (ISWC), Nov 2005, Galway, Ireland. Springer Verlag, 3729, pp.82-96, 2005, Lecture notes in computer science. 〈10.1007/11574620_9〉. 〈hal-00922476〉

Partager

Métriques

Consultations de la notice

428

Téléchargements de fichiers

183