<!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>LogMap and LogMapLt results for OAEI 2013</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ernesto Jime´nez-Ruiz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bernardo Cuenca Grau</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ian Horrocks</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Oxford</institution>
          ,
          <addr-line>Oxford</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We present the results obtained in the OAEI 2013 campaign by our ontology matching system LogMap and its 'lightweight” variant called LogMapLt. The LogMap project started in January 2011 with the objective of developing a scalable and logic-based ontology matching system. This is our fourth participation in the OAEI and the experience has so far been very positive. Presentation of the system LogMap [11, 12] is a highly scalable ontology matching system with built-in reasoning and inconsistency repair capabilities. LogMap also supports (real-time) user interaction during the matching process, which is essential for use cases requiring very accurate mappings. LogMap is one of the few ontology matching system that (1) can efficiently match semantically rich ontologies containing tens (and even hundreds) of thousands of classes, (2) incorporates sophisticated reasoning and repair techniques to minimise the number of logical inconsistencies, and (3) provides support for user intervention during the matching process. LogMap is also available as a “lightweight” variant called LogMapLt, which essentially only applies (efficient) string matching techniques.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Semantic indexation. The Horn propositional representation of the ontology modules
and the mappings are efficiently indexed using an interval labelling schema [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] — an
optimised data structure for storing directed acyclic graphs (DAGs) that significantly
reduces the cost of answering taxonomic queries [
        <xref ref-type="bibr" rid="ref17 ref6">6, 17</xref>
        ]. In particular, this semantic
index allows us to answer many entailment queries over the input ontologies and the
mappings computed thus far as an index lookup operation, and hence without the need
for reasoning. The semantic index complements the use of the propositional encoding
to detect and repair unsatisfiable classes.
1.1
      </p>
    </sec>
    <sec id="sec-2">
      <title>Adaptations made for the 2013 evaluation</title>
      <p>
        The new version of LogMap also integrates MORe [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ] as OWL 2 reasoner. MORe is
a modular reasoner which combines a fully-fledged (and slower) reasoner with a profile
specific (and more efficient) reasoner.
      </p>
      <p>
        LogMap’s algorithm described in [
        <xref ref-type="bibr" rid="ref11 ref12 ref13">11–13</xref>
        ] has also been adapted to meet the
requirements of the new interactive matching track which uses an Oracle as expert user.
      </p>
      <p>
        LogMap aims at making a reduced number of calls to the Oracle, i.e.: only those
borderline mappings that cannot be clearly included or excluded with automatic
heuristics. For each call to the Oracle, LogMap applies conflict and ambiguity based heuristics
(see [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for details) to reduce the remaining number of calls (i.e. mappings).
      </p>
      <p>
        Additionally, the interactive algorithm described in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] has been slightly extended
to include object and data properties in the process.
1.2
      </p>
    </sec>
    <sec id="sec-3">
      <title>Link to the system and parameters file</title>
      <p>LogMap is open-source and released under GNU Lesser General Public License 3.0.1
Latest components and source code are available from the LogMap’s Google code page:
http://code.google.com/p/logmap-matcher/.</p>
      <p>LogMap distributions can be easily customized through a configuration file
containing the matching parameters.</p>
      <p>LogMap, including support for interactive ontology matching, can also be used
directly through an AJAX-based Web interface: http://csu6325.cs.ox.ac.uk/.
This interface has been very well received by the community, with more than 900
requests processed so far coming from a broad range of users.
1.3</p>
    </sec>
    <sec id="sec-4">
      <title>Modular support for mapping repair</title>
      <p>Only very few systems participating in the OAEI 2013 competition implement repair
techniques. As a result, existing matching systems (even those that typically achieve
very high precision scores) compute mappings that lead in many cases to a large number
of unsatisfiable classes.</p>
      <p>We believe that these systems could significantly improve their output if they were
to implement repair techniques similar to those available in LogMap. Therefore, with</p>
      <sec id="sec-4-1">
        <title>1 http://www.gnu.org/licenses/</title>
        <p>
          the goal of providing a useful service to the community, we have made LogMap’s
ontology repair module (LogMap-Repair) available as a self-contained software component
that can be seamlessly integrated in most existing ontology matching systems [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
2
        </p>
        <sec id="sec-4-1-1">
          <title>Results</title>
          <p>In this section, we present a summary of the results obtained by LogMap and LogMapLt
in the OAEI 2013 campaign. Please refer to http://oaei.ontologymatching.
org/2013/results/index.html for complete results.
2.1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Benchmark track</title>
      <p>
        Ontologies in this track have been synthetically generated. The goal of this track is to
evaluate the matching systems in scenarios where the input ontologies lack important
information (e.g., classes contain no meaningful URIs or labels) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>Table 1 summarises the average results obtained by LogMap and LogMapLt. Note
that the computation of candidate mappings in LogMap and LogMapLt heavily relies
on the similarities between the vocabularies of the input ontologies; hence, there is a
direct negative impact in the cases where the labels are replaced by random strings.
2.2</p>
    </sec>
    <sec id="sec-6">
      <title>Anatomy track</title>
      <p>
        This track involves the matching of the Adult Mouse Anatomy ontology (2,744 classes)
and a fragment of the NCI ontology describing human anatomy (3,304 classes). The
reference alignment has been manually curated [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and it contains a significant number
of non-trivial mappings.
      </p>
      <p>Table 2 summarises the results obtained by LogMap and LogMapLt. LogMap ranked
3rd among the systems not using specialised background knowledge. Regarding
mapping coherence, only two tools (including LogMap) generated coherent alignments. The
evaluation was run on a server with 3.46 GHz (6 cores) and 8GB RAM.</p>
      <p>P</p>
      <p>R</p>
      <p>
        F
The Conference track uses a collection of 16 ontologies from the domain of academic
conferences [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. These ontologies have been created manually by different people and
are of very small size (between 14 and 140 entities). The track uses two reference
alignments RA1 and RA2. RA1 contains manually curated mappings between 21 ontology
pairs, while RA2 also contains composed mappings based on the alignments in RA1.
      </p>
      <p>Table 3 summarises the average results obtained by LogMap and LogMapLt. The
last column represents the total runtime on generating all 21 alignments. Tests were
run on a laptop with Intel Core i5 2.67GHz and 8GB RAM. LogMap ranked 3rd and
produced coherent alignments.
2.4</p>
    </sec>
    <sec id="sec-7">
      <title>Multifarm track</title>
      <p>
        This track is based on the translation of the OntoFarm collection of ontologies into
9 different languages [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Both LogMap and LogMapLt, as expected, obtained poor
results since they do not implement specific multilingual techniques.
2.5
      </p>
    </sec>
    <sec id="sec-8">
      <title>Library track</title>
      <p>The library track involves the matching of the STW thesaurus (6,575 classes) and the
TheSoz thesaurus (8,376 classes). Both of these thesauri provide vocabulary for
economic and social sciences. Table 4 summarises the results obtained by LogMap and
LogMapLt. The track was run on a computer with one 2.4GHz core with 7GB RAM
and 2 cores. LogMap ranked 5th in this track.</p>
    </sec>
    <sec id="sec-9">
      <title>2.6 Interactive matching track</title>
      <p>The interactive track is based on the conference track and it uses the RA1 reference
alignment as Oracle. Table 5 summarizes the obtained results by LogMap with and
without the interactive mode activated. LogMap with interactivity (LogMap-Int)
improved both the average Precision and Recall wrt LogMap with the interactive mode
deactivated, and it only performed 91 calls to the Oracle along the 21 matching tasks
(i.e. less than 5 questions per ontology pair).</p>
      <p>Not that, although LogMap-Int ranked 1st in the interactive matching track, it could
not outperform the best tool in the conference track, which obtained a F-measure of 0.74
(wrt the RA1 reference alignment). Nevertheless, there is still room for improvement
and we aim at implementing more sophisticated matching and interactive techniques.
2.7</p>
    </sec>
    <sec id="sec-10">
      <title>Large BioMed track</title>
      <p>
        This track consists of finding alignments between the Foundational Model of Anatomy
(FMA), SNOMED CT, and the National Cancer Institute Thesaurus (NCI). These
ontologies are semantically rich and contain tens of thousands of classes. UMLS
Metathesaurus [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] has been selected as the basis for the track reference alignments.
      </p>
      <p>In this track LogMap has been evaluated with two variants: LogMap and
LogMapBK. LogMap-BK uses normalisations and spelling variants from the general
(biomedical) purpose UMLS Lexicon,2 while LogMap has this feature deactivated.</p>
      <p>Table 6 summarises the results obtained by LogMap and LogMapLt. The table
shows the total time in seconds to complete all tasks in the track and averages for
Precision, Recall, F-measure and Incoherence degree. The track was run on a server with
16 CPUs and allocating 15GB RAM.</p>
      <p>Regarding mapping coherence, only two tools (including LogMap and its variant
LogMap-BK) generated almost coherent alignments. LogMap-BK ranked 3rd among
the systems not using specialised background knowledge and 1st among the systems
computing almost coherent alignments. LogMapLt was the fastest to complete all tasks.
2 http://www.nlm.nih.gov/pubs/factsheets/umlslex.html</p>
    </sec>
    <sec id="sec-11">
      <title>2.8 Instance matching</title>
      <p>This year only LogMap participated in the Instance Matching track. The dataset was
based on dbpedia ontology3 and included controlled transformations in the data (i.e.
value and structure transformations).</p>
      <p>Table 7 summarises the average results obtained by LogMap. The results are quite
promising considering that LogMap does not implement sophisticated instance
matching techniques. Furthermore, LogMap outperformed one of the participating tools
specialised in instance matching.</p>
      <p>Adaptations to the original dataset The original provided dataset was preprocessed
in order to be properly interpreted by the OWL API and to avoid inconsistencies when
reasoning. Next we summarise the performed changes:
– Added import of dbpedia: The dataset (ABOX) is based on dbpedia, however, the
dbpedia ontology was not included as TBOX. Hence the OWL API was
interpreting the instance entities of the dataset as “annotations” and not as “OWL named
individuals”. Furthermore, by adding dbpedia TBOX to the datasets, an OWL 2
reasoner could be used to infer the corresponding class type for each instance.
– Minor changes to dbpedia: The integration of the provided dataset (ABOX) and
dbpedia (TBOX) resulted in an inconsistent knowledge base. The inconsistencies
were due to some data property assertion axioms pointing to the incorrect datatype
and a functional datatype property which was used in two or more data property
assertion axioms with the same subject. To avoid these inconsistencies dbpedia was
slightly modified by removing the range and the functionality of the corresponding
data properties.
– Added additional object properties: The dataset also references the object
properties “curriculum”, “places” and “label” which are not included in the dbpedia
ontology. Hence, these properties has been explicitly declared as OWL object properties.
– Removal of invalid characters: the dataset also included some characters that could
not be processed by the OWL API and Prote´ge´ (e.g. \u).
3
3.1</p>
      <sec id="sec-11-1">
        <title>General comments and conclusions</title>
      </sec>
    </sec>
    <sec id="sec-12">
      <title>Comments on the results</title>
      <p>LogMap, apart from Benchmark and Multifarm tracks for which does not implement
specific techniques, has been one of the top systems in the OAEI 2013. Furthermore,</p>
      <sec id="sec-12-1">
        <title>3 http://dbpedia.org/</title>
        <p>it has also been one of the few systems implementing repair techniques and providing
(almost) coherent mappings in all tracks.</p>
        <p>LogMap’s main weakness relies on the fact that the computation of candidate
mappings is based on the similarities between the vocabularies of the input ontologies;
hence, there is a direct negative impact in the cases where the ontologies are lexically
disparate or do not provide enough lexical information (e.g. Benchmark and Multifarm).
3.2</p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>Discussions on the way to improve the proposed system</title>
      <p>LogMap is now a stable and mature system that has been made available to the
community. There are, however, many exciting possibilities for future work. For example we
aim at exploiting background knowledge to be competitive in the Multifarm track and
to improve the performance in the other tracks.
3.3</p>
    </sec>
    <sec id="sec-14">
      <title>Comments on the OAEI test cases</title>
      <p>The number and quality of the OAEI tracks is growing year by year. However, there is
always room for improvement:
Comments on the OAEI instance matching track. I consider the 2012 IIMB Instance
Matching track more challenging, from the logical point of view, than the current task.
The IIMB dataset included a TBOX and the controlled transformations also involved
changes on the instance class types. Thus the application of logic based techniques had
an important impact since lexically similar instances belonging to two disjoint class
types should not be matched.</p>
      <p>
        Comments on the OAEI interactive matching track. The new interactive track has been a
very important step forward in the OAEI, however, larger and more challengings tasks
should be included. For example, matching tasks (e.g. anatomy and largebio) where
the number of questions to the expert user or Oracle may be critical. Furthermore, it is
quite unlikely that the expert user will be perfect, thus, the interactive matching track
should also consider the evaluation of several Oracles with different error rates such as
the evaluation performed in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>Comments on the OAEI largebio track. One of the objectives of the largebio track is the
creation of a “silver standard” reference alignment by harmonising the output of the
different participating systems. In the next OAEI campaign it would be very interesting to
actively use this “silver standard” in the construction of the track’s reference alignment.
3.4</p>
    </sec>
    <sec id="sec-15">
      <title>Comments on the OAEI 2013 measures</title>
      <p>Although the mapping coherence is a measure already used in the OAEI we consider
that is not given yet the required weight in the evaluation. Thus, developers focus on
creating matching systems that maximize the F-measure but they disregard the impact
of the generated output in terms of logical errors. As a result, even highly precise
mappings lead to a large number of unsatisfiable classes.</p>
      <p>
        Thus, we encourage ontology matching system developers to develop their own
repair techniques or to use state-of-the-art techniques such as Alcomo [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and
LogMapRepair (see Section 1.3), which have shown to work well in practice [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
This work was supported by the Seventh Framework Program (FP7) of the European
Commission under Grant Agreement 318338, ”Optique”, the Royal Society, and the
EPSRC projects Score!, ExODA and MaSI3.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Agrawal</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borgida</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jagadish</surname>
            ,
            <given-names>H.V.</given-names>
          </string-name>
          :
          <article-title>Efficient management of transitive relationships in large data and knowledge bases</article-title>
          .
          <source>In: ACM SIGMOD Conf. on Management of Data</source>
          . pp.
          <fpage>253</fpage>
          -
          <lpage>262</lpage>
          (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Armas</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Cuenca Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Horrocks</surname>
          </string-name>
          , I.:
          <article-title>MORe: Modular Combination of OWL Reasoners for Ontology Classification</article-title>
          . In:
          <string-name>
            <surname>Int'l Sem</surname>
          </string-name>
          .
          <source>Web Conf. (ISWC)</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Armas</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Cuenca Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          ,
          <article-title>Jime´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
          </string-name>
          , E.:
          <article-title>MORe: a Modular OWL Reasoner for Ontology Classification</article-title>
          .
          <source>In: OWL Reasoning Evaluation (ORE)</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Modern Information Retrieval</article-title>
          . ACM Press / Addison-Wesley (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bodenreider</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>The unified medical language system (UMLS): integrating biomedical terminology</article-title>
          .
          <source>Nucleic Acids Research</source>
          <volume>32</volume>
          ,
          <fpage>267</fpage>
          -
          <lpage>270</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Christophides</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plexousakis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholl</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tourtounis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>On labeling schemes for the Semantic Web</article-title>
          . In:
          <string-name>
            <surname>Int'l World Wide</surname>
          </string-name>
          <article-title>Web (WWW) Conf</article-title>
          . pp.
          <fpage>544</fpage>
          -
          <lpage>555</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Cuenca</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Kazakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Sattler</surname>
          </string-name>
          ,
          <string-name>
            <surname>U.</surname>
          </string-name>
          :
          <article-title>Modular reuse of ontologies: Theory and practice</article-title>
          .
          <source>J. Artif. Intell. Res</source>
          .
          <volume>31</volume>
          ,
          <fpage>273</fpage>
          -
          <lpage>318</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Dowling</surname>
            ,
            <given-names>W.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gallier</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          :
          <article-title>Linear-time algorithms for testing the satisfiability of propositional Horn formulae</article-title>
          .
          <source>J. Log. Prog</source>
          .
          <volume>1</volume>
          (
          <issue>3</issue>
          ),
          <fpage>267</fpage>
          -
          <lpage>284</lpage>
          (
          <year>1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosoiu</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>dos Santos</surname>
          </string-name>
          , C.T.:
          <article-title>Ontology matching benchmarks: Generation, stability, and discriminability</article-title>
          .
          <source>J. Web Sem</source>
          .
          <volume>21</volume>
          ,
          <fpage>30</fpage>
          -
          <lpage>48</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gallo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Urbani</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Algorithms for testing the satisfiability of propositional formulae</article-title>
          .
          <source>J. Log. Prog</source>
          .
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <fpage>45</fpage>
          -
          <lpage>61</lpage>
          (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>LogMap: Logic-based and Scalable Ontology Matching</article-title>
          . In:
          <string-name>
            <surname>Int'l Sem</surname>
          </string-name>
          .
          <source>Web Conf. (ISWC)</source>
          . pp.
          <fpage>273</fpage>
          -
          <lpage>288</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Large-scale interactive ontology matching: Algorithms and implementation</article-title>
          .
          <source>In: European Conf. on Artif. Intell. (ECAI)</source>
          . pp.
          <fpage>444</fpage>
          -
          <lpage>449</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grau</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
          </string-name>
          , I.:
          <article-title>LogMap and LogMapLt results for OAEI 2012</article-title>
          .
          <source>In: Proceedings of the 7th International Workshop on Ontology Matching</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Jimenez-Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Evaluating mapping repair systems with large biomedical ontologies</article-title>
          .
          <source>In: 26th Description Logics Workshop</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Alignment Incoherence in Ontology Matching</article-title>
          .
          <source>Ph.D. thesis</source>
          , University of Mannheim (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Meilicke</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Castro</surname>
            ,
            <given-names>R.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Freitas</surname>
          </string-name>
          , F.,
          <string-name>
            <surname>van Hage</surname>
            ,
            <given-names>W.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montiel-Ponsoda</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>de</surname>
            <given-names>Azevedo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.R.</given-names>
            ,
            <surname>Stuckenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.</surname>
          </string-name>
          ,
          <article-title>Sˇva´b-</article-title>
          <string-name>
            <surname>Zamazal</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          , Sva´tek, V.,
          <string-name>
            <surname>Tamilin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trojahn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>MultiFarm: a benchmark for multilingual ontology matching</article-title>
          .
          <source>J. Web Sem</source>
          . (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Nebot</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berlanga</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Efficient retrieval of ontology fragments using an interval labeling scheme</article-title>
          .
          <source>Inf. Sci</source>
          .
          <volume>179</volume>
          (
          <issue>24</issue>
          ),
          <fpage>4151</fpage>
          -
          <lpage>4173</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. Sˇva´b,
          <string-name>
            <given-names>O.</given-names>
            , Sva´tek, V.,
            <surname>Berka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Rak</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          , Toma´sˇek, P.:
          <article-title>OntoFarm: towards an experimental collection of parallel ontologies</article-title>
          .
          <source>In: Int'l Sem. Web Conf. (ISWC)</source>
          .
          <source>Poster Session</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mork</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bodenreider</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Lessons learned from aligning two representations of anatomy</article-title>
          .
          <source>In: Conf. on Princliples of Knowledge Representation and Reasoning (KR)</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>