Qualifying Semantic graphs using Model Checking - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Qualifying Semantic graphs using Model Checking


Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns the adaptation of model checking techniques to semantic graphs. In this paper, we present a first method of converting RDF graphs into NμSMV and PROMELA languages.
Fichier principal
Vignette du fichier
Qualifying_Semantic_graphs_using_Model-Checing.pdf (611.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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


  • HAL Id : hal-00618006 , version 1


Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle. Qualifying Semantic graphs using Model Checking. International Conference On Innovations In Information Technology 2011, Apr 2011, United Arab Emirates. pp.1569402529. ⟨hal-00618006⟩
166 Consultations
179 Téléchargements


Gmail Facebook Twitter LinkedIn More