PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Constraint Processing
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Ontology Matching
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Implementing mapping composition
The VLDB Journal — The International Journal on Very Large Data Bases
LOM: a linguistic ontology matcher based on information retrieval
Journal of Information Science
Algebras of Ontology Alignment Relations
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
SECCO: On Building Semantic Links in Peer-to-Peer Networks
Journal on Data Semantics XII
Reusing ontology mappings for query routing in semantic peer-to-peer environment
Information Sciences: an International Journal
Semantic Web
Three semantics for distributed systems and their relations with alignment composition
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
| Hi-index | 0.00 |
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.