Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

A new approach based on NμSMV Model to query semantic graph

Abstract : The language most frequently used to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. Processing of large semantic graphs can be a limit to use semantics in modern information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. The data integration and sharing activities carried on the framework of the Semantic Web lead to large knowledge databases that must be queried, analyzed, and exploited efficiently. Many representation languages of the knowledge of the Semantic Web, starting with RDF, are based on directed, labeled graphs, which can be also manipulated using graph algorithms and tools coming from other domains. In this paper, we propose an analysis approach of RDF graphs by reusing the verification technology developed for concurrent systems. To this purpose, we define a translation from the SPARQL query language into temporal logic query, a general-purpose graph manipulation language implemented in the ScaleSem verification toolbox. This translation makes it possible to extend the expressive power of SPARQL naturally by adding temporal logic formulas characterizing sequences, trees, or general sub-graphs of the RDF graph. Our approach exhibits a performance comparable to dedicated SPARQL query evaluation engines, as illustrated by experiments on large RDF graphs.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger
Contributeur : Sylvain Rampacek Connectez-vous pour contacter le contributeur
Soumis le : mercredi 31 août 2011 - 11:06:25
Dernière modification le : vendredi 5 août 2022 - 14:54:00
Archivage à long terme le : : jeudi 1 décembre 2011 - 02:25:17


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00617975, version 1


Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle. A new approach based on NμSMV Model to query semantic graph. International Conference on Digital Information Processing and Communications, Jul 2011, Ostrava, Czech Republic. pp.510-524. ⟨hal-00617975⟩



Consultations de la notice


Téléchargements de fichiers