Semantic flow networks: Semantic interoperability in networks of ontologies

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In an open context such as the Semantic Web, information providers usually rely on different ontologies to semantically characterize contents. In order to enable interoperability at a semantic level, ontologies underlying information sources must be linked by discovering alignments, that is, set of correspondences or mappings. The aim of this paper is to provide a formal model (i.e., Semantic Flow Networks) to represent networks of ontologies and alignments with the aim to investigate the problem of composite mapping discovery. Semantic Flow Networks (SFN) differ from other models of networks of ontologies for two main aspects. SFN consider constraints over mappings that are necessary to take into account their dependencies. Moreover, a different notion of mapping, that is, compound mapping is considered. Complexity results and a CSP formulation for composite mapping discovery are provided. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Fionda, V., & Pirró, G. (2012). Semantic flow networks: Semantic interoperability in networks of ontologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7185 LNCS, pp. 64–79). https://doi.org/10.1007/978-3-642-29923-0_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free