A new approach based on NμSMV Model to query semantic graph - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

(1) , (1) , (1)
1

Résumé

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.
Fichier principal
Vignette du fichier
A_new_approach_based_on_NI_SMV_Model_to_query_semantic_graph.pdf (647.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00617975 , version 1 (31-08-2011)

Identifiants

  • HAL Id : hal-00617975 , version 1

Citer

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⟩
215 Consultations
175 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More