Abstract : The most frequently used language 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. 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 between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2SPIN, which converts RDF graphs into SPIN language. This conversion aims checking the semantic graphs with the model checker SPIN in order to verify the consistency of the data. To illustrate our proposal we used RDF graphs derived from IFC files. These files represent digital 3D building model. Our final goal is to check the consistency of the IFC files that are made from a cooperation of heterogeneous information sources.
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00639247
Contributeur : Sylvain Rampacek
<>
Soumis le : mardi 8 novembre 2011 - 15:40:04
Dernière modification le : mercredi 12 septembre 2018 - 01:27:18
Document(s) archivé(s) le : jeudi 9 février 2012 - 02:42:33
Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle. Verifying Semantic Graphs With the Model Checker SPIN. International Journal of Digital Information and Wireless Communications (IJDIWC), SDIWC, 2011, 1 (1), pp.64-74. ⟨hal-00639247⟩
