Qualifying Semantic graphs using Model Checking

Abstract : 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.
Type de document :
Communication dans un congrès
Sponsored by IEEE. International Conference On Innovations In Information Technology 2011, Apr 2011, United Arab Emirates. pp.1569402529, 2011
Liste complète des métadonnées

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

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00618006
Contributeur : Sylvain Rampacek <>
Soumis le : mercredi 31 août 2011 - 11:50:02
Dernière modification le : lundi 21 mars 2016 - 17:27:08
Document(s) archivé(s) le : jeudi 1 décembre 2011 - 02:25:50

Fichier

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

Identifiants

  • HAL Id : hal-00618006, version 1

Collections

Citation

Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle. Qualifying Semantic graphs using Model Checking. Sponsored by IEEE. International Conference On Innovations In Information Technology 2011, Apr 2011, United Arab Emirates. pp.1569402529, 2011. 〈hal-00618006〉

Partager

Métriques

Consultations de
la notice

413

Téléchargements du document

90