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.
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00618006 Contributeur : Sylvain RampacekConnectez-vous pour contacter le contributeur Soumis le : mercredi 31 août 2011 - 11:50:02 Dernière modification le : dimanche 26 juin 2022 - 00:42:35 Archivage à long terme le : : jeudi 1 décembre 2011 - 02:25:50
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⟩