<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>MDSS: A framework for the integration of ontology mapping tools</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Gabriele Marcelli IASI - CNR Viale Manzoni</institution>
          ,
          <addr-line>30 00185 Roma</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>- In the last period there has been a proliferation of tools that support users in discovering mappings among given ontologies in an automatic or semi-automatic way. However the way such tools are developed is unstandardized: they usually differ in input/output formats, type of user interaction and external resources exploited, hindering the possibility of making them interoperate (for example composing different mapping algorithms). In this paper we propose MDSS (Mapping Discovery Support System) a framework for the integration of mapping tools, aiming at solving interoperability issues among different mapping discovery tools and at supporting users in choosing the best suited mapping discovery algorithm for their needs.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>I. INTRODUCTION
building the Semantic Web is to enable interoperability
among different ontologies. Ontologies can interoperate
only if correspondences between their elements have
been identified and established. At the moment, if a
problem of this type is encountered, the mapping is mainly
achieved by hand. But this task is tedious, error-prone,
and time consuming; therefore the manual solution of
the ontology interoperability problem is likely to become
a bottleneck in building a network of cooperating
information management systems. Hence, introduction of
new methodologies and user-friendly tools that support
users (knowledge engineers) in discovering semantic
correspondences is crucial to the success of the Semantic
Web. For instance, in order to discover semantic
correspondences, knowledge engineers generally must possess
a high degree of technical skill, and a deep knowledge
of algorithms employed.</p>
      <p>
        Our system aims at solving the issue of
interoperability among different mapping discovery tools and it also
aims at supporting users in choosing optimal mapping
discovery algorithms.
relations holding among the entities in the two
ontologies (concepts and properties equivalence/subsumption,
similarity degrees etc.). The process is also known
in literature as ontology matchmaking ([
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]), ontology
alignment ([
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]), or ontology mapping ([16]), where the
key terms mapping and alignment have been defined
in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] as follows: mapping is “a formal expression
that states the semantic relation between two entities
belonging to different ontologies”, and alignment is a set
of correspondences between two ontologies expressed as
mappings.
      </p>
      <p>However, as stated before, performing mapping
discovery is a complex process, and as long as it will require
a deep human intervention it will be highly expensive
and hardly scalable.</p>
      <p>
        Therefore, the hope is to automatize as much as
possible the process (see for instance in [16] and [18])
and that is the main reason for proliferation of tools
that support users in discovering mappings among given
ontologies; they usually make possible computation of
alignments in an automatic or semi-automatic way - see
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and [16].
      </p>
      <p>
        These tools may be characterized by the following
function (see [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]):
      </p>
      <p>A0 = f (O1, O2, A, P, R)
where A0 is the result alignment, O1, O2 are the source
ontologies, A is some previously known alignment
between O1 and O2, P is a set of parameters, and R is
a set of external resources used in the process.</p>
      <p>We have chosen to adopt these definitions in order to
abstract from implementation details of mapping
discovery tools and to have a unifying view about their features;
moreover, this characterization of mapping discovery
tools is a first step toward definition of a “mapping
discovery algebra” (e.g. formally representing the iteration
and composition of mapping discovery tools).</p>
      <p>Figure 1 describes the Input/Output schema of
mapping discovery tools, but it does not highlight that
alignments (A, A0) represented by tools and
parameters/resources (P, R) of tools are not standard; therefore
composition of mapping algorithms from different tools
is hard, when not impossible at all. Moreover the choice
of mapping discovery strategies is not supported by tools,
and user interaction strongly differs among them; in
other words, the focus of mapping discovery tools (as
clarified for instance in [16]) is on the performance of
mapping discovery, it is not on users (the knowledge
engineers).</p>
      <p>We conclude highlighting two open issues of mapping
discovery process we deal with:
• from the system point of view: the lack of a
common platform to compose mapping algorithms
from different tools;
• from the user point of view: the lack of a strategy
to support users in performing mapping discovery
process.</p>
    </sec>
    <sec id="sec-2">
      <title>We propose a framework called MDSS (Mapping</title>
      <p>Discovery Support System) to support users in the
mapping discovery process using algorithms supported from
different tools; this framework is an intermediate layer
between mapping tools and knowledge engineers; MDSS
cooperates with existing tools to compute alignments (it
is not another mapping discovery tool).</p>
      <p>MDSS aims at solving the two open issues mentioned
in Section II, providing the following main features:
• it handles low-level details regarding input and
output of each tool;
• it supports users in the choice of mapping discovery
algorithms.</p>
      <p>Low-level handling of inputs and outputs makes easier
composition of algorithms from different tools;
moreover, this also simplifies access to supported mapping
tools, providing a single and uniform interaction
modality.</p>
      <p>The choice of mapping algorithms requires a high
level of technical knowledge; in order to simplify this
choice, we propose a new approach: the mapping
algorithm chosen is obtained thanks to a set of qualitative
parameters. More details of this approach are described
in Section III-B.</p>
      <p>A global picture of our system is sketched in Figure 2.</p>
      <p>
        Let us explain the main concepts exposed in the
diagram:
• MDSS cooperates with existing tools to compute
alignments; access to external tools is mediated
through the adapter pattern[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] (one adapter
component for each tool),
• inputs and outputs depicted in Figure 2 have the
same meaning of inputs and outputs of Figure 1
except P , that here represents not only tool
parameters, but also parameters of the MDSS system.
      </p>
      <p>MDSS parameters are used to determine how our
system works; for instance, they are used to choose
mapping discovery algorithms, or to select particular
formats for alignment representation.</p>
      <sec id="sec-2-1">
        <title>A. MDSS Architecture</title>
        <p>We have designed MDSS architecture according to
modularity and extensibility. Modularity means that
each component not only is independent, but it also
has definite boundaries and specific goals. Extensibility
means that it is easy to extend the set of supported
mapping discovery tools; in fact, it is enough to create
a plug-in component as described below.</p>
        <p>Main components of MDSS architecture, shown in
Figure 3, are: the Control Subsystem, the Tools and
Algorithms Registries, the Algorithm Chooser Module,
the Alignment Formats Handling Subsystem, and the
Mapping Discovery Tools Adaptation Layer.</p>
        <p>The Control Subsystem is the core of MDSS. It
manages operations, components and resources, and it
plays the role of front controller to manage external
requests to the system. It contains the main application
controller that interacts with other components of the
system.</p>
        <p>The Tools and Algorithms Registries are two
repositories; the first is the Tools Registry that contains all
the knowledge that MDSS has about integrated tools
and the second, the Algorithms Registry, contains all the
knowledge that MDSS has about algorithms of each tool.</p>
        <p>In particular, the Tools Registry contains the identifier of
tools in the system, the set of algorithms that it provides,
and informations about supported alignment formats; the
Algorithms Registry contains the unique identifier of an
algorithm, its description, metadata about its features,
and metadata about parameters and resources managed.</p>
        <p>The main purpose of the Tools Registry is to keep track
of tools integrated into MDSS, and it is used to interact
with them. The main purpose of Algorithms Registry is to
store metadata informations about algorithms used by the
Algorithm Chooser Module and the Control Subsystem.</p>
        <p>The Algorithm Chooser Module implements the
logic supporting mapping algorithms choice; this choice
is made according to users requests: the Algorithm
Chooser Module extracts knowledge about algorithms
from the Algorithms Registry, where it is expressed as
sets of qualitative parameters; then these parameters
are compared to the set of preferences expressed by
users. Finally, according to users selections, the module
chooses the algorithm.</p>
        <p>
          Actually, algorithms are classified on the basis of
techniques employed, in a way approximately similar
to the classification made in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Algorithms choice
is then made comparing users preferences with features
of each algorithm, in a tabular fashion. We would like
to remark that our main concern in this work has been
defining our framework, while development of optimal
implementations of its components will be addressed in
future work; in particular, aspects relative to mapping
algorithms classification and selection are one of our
main lines of future research, as remarked later in
Section VI.
        </p>
        <p>MDSS
Control Subsystem</p>
        <p>Alignment Formats</p>
        <p>Handling Subsystem
Algorithm
Chooser
Module</p>
        <p>Tools and
Algorithms</p>
        <p>Registries
Tool 1
adaptation
component</p>
        <p>Tool i
adaptation
component</p>
        <p>Tool n
adaptation
component</p>
        <p>Mapping Discovery Tools Adaptation Layer
Mapping
discovery
tool 1</p>
        <p>Mapping
discovery
tool i</p>
        <p>Mapping
discovery
tool n
Fig. 3. Architecture of MDSS</p>
        <p>
          The Alignment Formats Handling Subsystem man- 2) ready phase.
ages alignment representations. This functionality is
essential because no affirmed standard exists (some propos- BOOT- UP PHASE
als are in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]). This subsystem offers both automatic and First of all, the Control Subsystem looks for available
on-demand management of alignment representations, PMDMs. For each PMDM found, the Control Subsystem
performed exploiting the Mapping Discovery Adaptation extracts metadata about integrated tool from the PMDM,
Layer. and it adds them to the Tools Registry; then, it builds
        </p>
        <p>The Mapping Discovery Adaptation Layer is an the list of algorithms provided by the tool. For each
abstraction layer from mapping discovery tools; in other algorithm in this list, metadata is extracted and added to
words MDSS components interact only with this layer, the Algorithms Registry. Now, MDSS is ready to accept
they never interact directly with tools. The Mapping requests.</p>
        <p>Discovery Adaptation Layer is composed of several
modules, one for each tool supported. Each module READY PHASE
is called Pluggable Mapping Discovery Module (or When MDSS is ready, the Control Subsystem waits for
PMDM), and each module is responsible of encap- requests. This request may contain a specific mapping
sulating characteristics of a single mapping discovery algorithm name, or it contains a set of preferences that
tool. Unlike components described above, PMDMs are MDSS has to use in order to choose this algorithm.
not static entities of the system; they are dynamically In order to determine it, the Control Subsystem sends
discovered and loaded into MDSS at startup time. They the set of preferences to the Algorithm Chooser
Modare plug-ins, thus making MDSS easily extensible in ule. This component examines the preferences, and it
supporting mapping tools; in other words it is enough selects in the Algorithm Registry the algorithm that better
writing a PMDM to add support for a specific tool. matches them. The algorithm found is then sent to the
A Pluggable Mapping Discovery Module (PMDM) Control Subsystem.
encapsulates distinctive characteristics and behaviour of Once MDSS knows which algorithm to use, the
mapa specific tool. In particular, each module represents both ping process starts. First of all, the Control Subsystem
semantics and functionalities of a particular tool. asks to the Algorithms Registry which tool implements
At semantic level, a PMDM provides: the chosen algorithm. Then, it queries the Tools Registry
• information about tools - entries in Tools Registry, to gather informations about the tool.
• metadata about algorithms provided by tools - en- Using these information, the Alignment Formats
Hantries in Algorithms Registry, dling Subsystem converts the input alignment to the tool
• information about alignment format of tools - used specific alignment format. The request is then dispatched
by Aligment Formats Handling Subsystem. to the PMDM of the tool. At first, the PMDM filters
At functional level, a PMDM provides: out inputs not supported by the tool; at second, the
PMDM invokes the tool that actually computes the
alignment. The alignment is then converted by the Alignment
Formats Handling Subsystem to the desired alignment
format and the Control Subsystem returns it.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>IV. MDSS IN A SOA CONTEXT</title>
    </sec>
    <sec id="sec-4">
      <title>The design of MDSS described above is quite general;</title>
      <p>we did not specify any implementation detail, and in
particular how such an architecture could be instantiated
in a specific context. In fact, we have designed MDSS
structure to be independent of its actual realization, be
it a stand-alone application, or a web application, etc.</p>
      <p>An interesting possibility is instantiating it in the
context of Service-Oriented Architecture (SOA) using
Web Service technology. In such an architecture,
software functionalities are represented as discoverable
services on the network; every function is defined as
• a standard, tool-independent, communication
interface for higher level components,
• low-level interaction with mapping tools,
• low-level handling of tools alignment formats.</p>
      <p>Summarizing, a PMDM is the basic component
needed to integrate tools into the MDSS architecture.
To add a new mapping discovery tool, it is enough
developing a new PMDM module and plugging it into
MDSS. In order to do that, the new tool has to support
automatic alignment computation.</p>
      <sec id="sec-4-1">
        <title>B. Information flow</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>We will now describe the information flow among MDSS components. We may divide this flow into two main phases: 1) boot-up phase;</title>
      <p>an independent service, with a well-defined invokable above. Interaction with the system is so extended to other
interface. Main benefits of SOA are independence from software, and not only to human users. Remote mapping
development technologies and platforms, high degree of discovery tools are also supported, since as depicted only
interoperability, easy integration of different services, the tool’s PMDM is local to MDSS.
on-demand composition of simpler services to perform
complex tasks.</p>
      <p>In this context, our goal is using the MDSS archi- MDSS mapping discovery service
tecture to provide a mapping discovery and ontology Software Agent consumes
alignment service. WIenbteSrfearcveice exposes aMrcDhSitSecctourree</p>
      <p>Since its beginnings the semantic web has been consumes
thought explicitly as “an environment where software Human User plugs into plugs into
saogpehnitsstircoaatmedintgasfkrso mforpaugseertso” p([a2g]e).cBaunt rseuacdhilaynceanrvryiroonu-t RePmMotDeMTool LoPcMalDTMool
emaecnht orethqeuri,reesvesnoftwwiathreouatgebnetisngtoexsopmreesswlyayduesnidgenresdtantod Remote Server uses uses
work together. When semantics is expressed using dif- MaRppeimngotTeool MapLpoincgalTool
ferent ontologies, some kind of reconciliation service is
needed, in order to enable agent interoperability without
human intervention. To summarize: semantic web needs Fig. 4. MDSS as a service
semantic coordination.</p>
      <p>A mapping discovery service could provide some of
this coordination; when two semantically enabled agents V. RELATED WORK
use different vocabularies - that is, different ontologies
- they can ask the service to obtain correspondences As described in Section II, mapping tools solve the
between them, enabling cooperation without human in- mapping discovery process issue, but it is worth noting
teraction. that there are few systems in literature explicitly designed</p>
      <p>
        As an example, let’s suppose an user entrusting his to solve the main issue we deal with: mapping discovery
personal agent to make weekly reports on books about tools interoperability.
themes of his interest. The user would express his About this issue, the INRIA Alignment API[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is
request through a specific ontology; the agent would maybe the most remarkable proposed solution. INRIA
in turn query online books resellers - like for instance proposes an RDF-based alignment representation format
Amazon.com or Barnes&amp;Noble - whose books would and a Java API to handle it. Main goals of INRIA
be described, in general, with different ontologies. Ex- Alignment API are:
ploiting a mapping discovery service, the agent could • composition of alignment algorithms,
translate the request of the user into the vocabulary of • iterative mapping process, through reuse of
previthe reseller, obtaining the desired result. ously computed alignments,
      </p>
      <p>Of course, to realize a such a service one might • mapping discovery algorithms modularization.
simply expose as web service some existing mapping The main focus of the INRIA system is to define an
tool; but this would lead to a different mapping discovery alignment representation format and to provide an API
service for each mapping discovery software, with poor to work with it; in our system, we used this format due
interoperability among them. to its flexibility; in fact it is easy (using the provided</p>
      <p>Instead, using the MDSS architecture as base, we API) to convert the INRIA format to a large number of
have a single service able to use mapping discovery other formats.
capabilities of a variety of tools. This is not restrictive, Moreover, differently from INRIA, our system
exsince MDSS is designed to interact with remote mapping plicitly supports integration of “external” algorithms as
tools, so it can even take advantage of other similar described in Section III-A. In the INRIA tool, in fact,
services. in order to use an external algorithm, it has to be</p>
      <p>
        The scenario is represented in Figure 4. The core implemented using the provided API.
MDSS architecture can be easily exposed as web service, MDSS aims at playing the same role in the mapping
realising the mapping discovery service we described discovery field as the GATE system [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] plays in
the Natural Language Processing (NLP) field; as GATE
represents a framework for NLP, that provides a
framework of reusable Language Engineering components,
MDSS represents a framework for mapping discovery.
      </p>
      <p>
        It is worth also referring to several mapping discovery
tools studied, in view of the fact that each of them
possess ideas (e.g., iterative mapping discovery) supported
by our MDSS. They are FOAM [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], CROSI
Mapping System (CMS) [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], and COMA++ [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>FOAM is a mapping discovery tool developed by
University of Karlsruhe. Similarly to our system (as
described in Section III-B), FOAM aims at supporting
the choice of mapping strategies using some parameters
called “scenario” and “strategy”.</p>
      <p>CMS is a mapping discovery system developed by
University of Southhampton and HP Laboratories.
Similarly to our system, CMS supports existing mapping
tools integration; in fact it integrates the INRIA
Alignment API and FOAM implementing an ad-hoc wrapper
for each of them. MDSS, instead, supports existing
mapping tools integration using PMDMs. This approach
(described in Section III-A) allows supporting tools with
automatic alignment computation.</p>
      <p>COMA++, developed by University of Leipzig, is
a mapping tool proposing a composite approach to
the mapping discovery issue: different algorithms are
combined, using computed alignments as input to next
iterations of mapping process. MDSS supports the same
mapping process approach, naming it iterative mapping
discovery.</p>
    </sec>
    <sec id="sec-6">
      <title>VI. CONCLUSION AND FUTURE WORK</title>
    </sec>
    <sec id="sec-7">
      <title>In this paper we have presented MDSS (Mapping</title>
      <p>Discovery Support System), a framework for mapping
tools integration, aiming at solving interoperability issues
among different mapping discovery tools and at
supporting users in choosing the best suited mapping
discovery algorithm for their needs. These issues were only
partially addressed by existing solutions in literature.
We have presented MDSS as an abstract architecture,
and proposed a possible implementation based on Web
Service technology. In the future our research about
MDSS will concentrate along two lines:
• creating new MDSS integration patterns, in order
to easily integrate an increasing number of
Ontology mapping tools
• enhancing the mechanism for supporting the
user choice of an optimal mapping algorithm
(with respect to users mapping problems); this
requires development of a more sophisticated
Decision Support System (DSS) being able to match
users problem descriptions with MDSS integrated
tools.
[16] Y. Kalfoglou and M. Schorlemmer, “Ontology mapping: the
state of the art,” The Knowledge Engineering Review, 2003.
[17] J. Madhavan, E. Rahm, and P. A. Bernstein, “Generic schema
matching with cupid,” in Proc. 27th VLDB Conference, Roma,
2001.
[18] N. Noy, “Semantic integration: a survey of ontology-based
approaches,” ACM SIGMOD Record, 2004.
[19] P. Shvaiko and J. Euzenat, “Ontology matching initiative.”
[Online]. Available: http://www.ontologymatching.org
[20] ——, “A survey of schema-based matching approaches,”
Journal on Data Semantics, 2005.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Amueller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Do</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Massmann</surname>
          </string-name>
          , and E. Rahm, “
          <article-title>Schema and ontology matching with coma++,” in SIGMOD</article-title>
          , June 14- 16
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Handler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Lassila</surname>
          </string-name>
          , “
          <article-title>The semantic web</article-title>
          ,
          <source>” Scientific American</source>
          , pp.
          <fpage>28</fpage>
          -
          <lpage>37</lpage>
          , May
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bianchini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Castano</surname>
          </string-name>
          ,
          <string-name>
            <surname>F. D'Antonio</surname>
            ,
            <given-names>V. D.</given-names>
          </string-name>
          <string-name>
            <surname>Antonellis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Harzallah</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Missikoff</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Montanelli</surname>
          </string-name>
          , “
          <article-title>Digital resource discovery: Semantic annotation and matchmaking techniques,” in Proc. of the Interoperability for Enterprise Software and Applications Conference (I-ESA</article-title>
          <year>2006</year>
          ) , Bordeaux, France,
          <year>March 2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tablan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          , “
          <article-title>Gate: A unicode-based infrastructure supporting multilingual information extraction,”</article-title>
          <source>in Proc. Workshop on Information Extraction for Slavonic and other Central and Eastern European Languages, Borovets, Bulgaria</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tablan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          , “
          <article-title>Evolving gate to meet new challenges in language engineering</article-title>
          ,”
          <source>Natural Language Engineering</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bouquet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ehrig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , E. Franconi,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kroetzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Serafini</surname>
          </string-name>
          , G. Stamou,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sure</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Tessaris</surname>
          </string-name>
          , “
          <article-title>Knowledgeweb deliverable 2.2.1 - specification of a common framework for characterizing alignment,” Knowledge Web Consortium</article-title>
          ,
          <source>Tech. Rep.</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Tablan</surname>
          </string-name>
          , “
          <article-title>Gate: an architecture for development of robust hlt applications,” in Proc. of the 40th Annual Meeting on Association for Computational Linguistics</article-title>
          .
          <source>Association for Computational Linguistics</source>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>H.</given-names>
            <surname>Do</surname>
          </string-name>
          and E. Rahm, “
          <article-title>Coma - a system for flexible combination of schema matching approaches,”</article-title>
          <source>in Proc. of the 28th VLDB Conference</source>
          ,
          <year>2002</year>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ehrig</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Staab</surname>
          </string-name>
          , “Qom: Quick ontology mapping,”
          <source>in Proc. of the International Semantic Web Conference (ISWC)</source>
          ,
          <year>2004</year>
          , pp.
          <fpage>683</fpage>
          -
          <lpage>697</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ehrig</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sure</surname>
          </string-name>
          , “
          <article-title>Ontology mapping - an integrated approach,”</article-title>
          <source>in Proc. of the European Semantic Web Symposium (ESWS)</source>
          ,
          <year>2004</year>
          , pp.
          <fpage>76</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , “
          <article-title>An api for ontology alignment</article-title>
          ,”
          <source>in Proc. 3rd international semantic web conference</source>
          ,
          <source>Hiroshima(JP)</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Barrasa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bouquet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Bo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dieng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ehrig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hauswirth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jarrar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , G. Stamou,
          <string-name>
            <given-names>H.</given-names>
            <surname>Stuckenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tessaris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. V.</given-names>
            <surname>Acker</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Zaihrayeu</surname>
          </string-name>
          , “
          <article-title>Knowledgeweb deliverable 2.2.3 - state of the art on ontology alignment,” Knowledge Web Consortium</article-title>
          ,
          <source>Tech. Rep.</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>E.</given-names>
            <surname>Gamma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Helm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Vlissides</surname>
          </string-name>
          , Design Patterns:
          <article-title>Elements of Reusable Object-Oriented Software</article-title>
          .
          <source>Addison-Wesley</source>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kalfoglou</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Hu</surname>
          </string-name>
          , “
          <article-title>Issues with evaluating and using publicly available ontologies</article-title>
          ,”
          <source>in Proc. of 4th International EON Workshop</source>
          ,
          <article-title>Evaluating Ontologies for the Web</article-title>
          , Edinburgh, UK, May
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kalfoglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Reynolds</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Shadbolt</surname>
          </string-name>
          , “Crosi project,
          <source>final report,” School of Electronics and Computer Science</source>
          , University of Southhampton,
          <source>Tech. Rep.</source>
          ,
          <year>2005</year>
          . [Online]. Available: http://eprints.ecs.soton.ac.uk/11717/
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>