6533b828fe1ef96bd1287940

RESEARCH PRODUCT

Qualifying semantic graphs using model checking

Sylvain RampacekChristophe NicolleMahdi Gueffaz

subject

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[INFO.INFO-WB] Computer Science [cs]/WebComputer science[ INFO.INFO-WB ] Computer Science [cs]/Web0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesSocial Semantic Webtemporal logicSemantic similaritySemantic computing0202 electrical engineering electronic engineering information engineeringSemantic analyticsSemantic integrationSemantic Web StackInformation retrievalbusiness.industry[INFO.INFO-WB]Computer Science [cs]/WebSemantic search020207 software engineeringSemantic interoperability[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationModel-checking010201 computation theory & mathematicsSemantic graphTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS[INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationArtificial intelligencebusinesscomputerNatural language processing

description

International audience; 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://doi.org/10.1109/innovations.2011.5893832