The problem of merging several ontologies has important applications in the Semantic Web, medical ontology engineering, and other domains where information from several distinct sources needs to be integrated in a coherent manner. We propose to treat ontology merging as a problem of social choice, i.e., as a problem of aggregating the input of a set of individuals into an adequate collective de...

With the increasing number of ontologies available on the web, the problem of merging ontologies from different sources to interoperate applications becomes important. This paper presents a novel approach for merging of light-weight ontologies based on answer set programming (ASP) and linguistic background knowledge. ASP provides a declarative execution environment for intuitive merging rules. ...

In this paper, we present the results obtained by our DKP-AOM system within the OAEI 2016 campaign. DKPAOM is an ontology merging tool designed to merge heterogeneous ontologies. In OAEI, we have participated with its ontology mapping component which serves as a basic module capable of matching large scale ontologies before their merging. This is our second successful participation in the OAEI ...

While there are numerous tools for ontology matching, most approaches provide only little information about the true nature of the correspondences they discover, restricting themselves on the mere links between matching concepts. However, many disciplines such as ontology merging, ontology evolution or data transformation, require more-detailed information, such as the concrete relation type of...

We present an operational interpretation of quantum discord based on the quantum state merging protocol. Quantum discord is the markup in the cost of quantum communication in the process of quantum state merging, if one discards relevant prior information. Our interpretation has an intuitive explanation based on the strong subadditivity of von Neumann entropy. We use our result to provide opera...

Following the multistage design approach, we propose two asymptotically efficient truthful double auction mechanisms, the BC-LP mechanism and the MBC mechanism, for an exchange market with many buyers and sellers. In this market, each buyer wants to procure a bundle of commodities and each seller supplies one unit of a commodity. Furthermore, various transaction-related costs will be incurred w...

This paper describes the operation with the software environment called KSM (Knowledge Structure Manager) that supports a methodology for building and reusing knowledge models. The methodology is a useful tool for developers who need to build large and complex knowledge models in real world projects. The enviroment helps developers in applying the whole methodology to build the final system and...

Match-merging, or BY merging, is the most common merging technique used in SAS**. Yet, how it works is not always obvious. This tutorial shows many of the technique’s nuances and subtleties, gives examples of merges where even experienced programmers have been tripped up, and demonstrates defensive programming strategies.

This report discusses an algorithm for merging hyperellipsoidal clusters The e ective merging radius between two clusters is introduced and this measure is used to determine the order in which clusters are combined We continue to merge clusters until a desired number of clusters is reached or until the minimum e ective merging radius is larger than some predetermined threshold

Due to mobility, spontaneous networks composed of nodes following similar group mobility patterns are likely to overlap. Previous solutions invariantly considered overlapping as a permanent state where the networks combine to form a new network. In this paper, we propose a more realistic model where merging is either permanent or transient. Our contributions are twofold. First, we introduce a m...