<!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>A Categorical Approach to Ontology Alignment</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mihai Codescu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Till Mossakowski</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oliver Kutz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Knowledge and Language Engineering Otto-von-Guericke University of Magdeburg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontology matching and alignment is a key mechanism for linking the diverse datasets and ontologies arising in the Semantic Web. We show that category theory provides the powerful abstractions needed for a uniform treatment at various levels: semantics, language design, reasoning and tools. The Distributed Ontology Language DOL is extended in a natural way with constructs for networks of ontologies. We in particular show how the three semantics of Zimmermann and Euzenat can be uniformly and faithfully represented using these DOL language constructs. Finally, we summarise how the DOL alignment features are currently being implemented in the Ontohub/Hets ecosystem, including support for the OWL and Alignment APIs.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Ontology matching and alignment is a key mechanism for linking the diverse datasets
and ontologies arising in the Semantic Web. Matching based on statistical methods
is a relatively developed eld, with yearly competitions since 2004 comparing the
various strengths and weaknesses of existing algorithms [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>Ontology alignments express semantic correspondences between the entities of
dierent ontologies. The correspondences of an alignment can be various relations, like
equivalence, subsumption, disjointness or instance between entities of the ontologies,
which can be named entities, like classes, roles, individuals, function symbols etc. or
even complex concepts or terms.</p>
      <p>
        The problem of giving an interpretation to alignments in terms of the semantics
of the ontologies is complicated by the fact that the domains of interpretation of
the two ontologies may be incompatible. Dierent ways of dealing with this problem
exist in the literature. The rst solution, called simple semantics in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], is to assume
that the domain of interpretation of the ontologies is uniform [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. The second
solution, called integrated semantics in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], is to assume the existence of a universal
domain together with functions relating the domains of individual ontologies to the
universal domain. This approach has been introduced in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], under the name of
integrated distributed description logics (IDDL). Finally, the domains of the individual
ontologies can be related among themselves directly instead via a unique universal
domain. This approach gives rise to the third semantics, called contextualised
semantics in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. It was introduced in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] as an attempt to generalise a number of
existing semantic formalisms (distributed rst-order logics (DFOL) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], distributed
description logics (DDL) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and contextualised ontologies (C-OWL) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) and later
corrected to a relational semantics in [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. Package-based description logics (PDL) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
also fall in this semantic category. Moreover, [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] discusses the implications of these
possible interpretations of alignments with respect to reasoning and composition of
alignments.
      </p>
      <p>
        A major problem with these approaches is their diversity. There exist some
attempts for unication, which however remain unsatisfactory: there is no common
syntax, no common semantic framework, and no common tool support. In this work,
we show how category theory can provide such a unifying framework at various levels,
improving previous related work [
        <xref ref-type="bibr" rid="ref11 ref15 ref22 ref24">24, 15, 22, 11</xref>
        ] which did not spell out details, and
did not make the step from abstract description and case studies to language design
and implementation.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>General approach</title>
      <p>The general representation and reasoning framework that we propose includes: 1)
a declarative language to specify networks of ontologies and alignments, with
independent control over specifying local ontologies and complex alignment relations, 2)
the possibility to align heterogeneous ontologies, and 3) in principle, the possibility
to combine dierent alignment paradigms (simple/integrated/contextualised) within
one network.</p>
      <p>Through category theory, we obtain a unifying framework at various levels:
semantic level We give a uniform semantics for distributed networks of aligned
ontologies, using the powerful notion of colimit, while reecting properly the
semantic variation points indicated above.
(meta) language level We provide a uniform notation (based on the distributed
ontology language DOL) for distributed networks of aligned ontologies, spanning
the dierent possible semantic choices.
reasoning level Using the notion of colimit, we can provide reasoning methods for
distributed networks of aligned ontologies, again across all semantic choices. 1
tool level The tool ontohub.org provides an implementation of analysis and
reasoning for distributed networks of aligned ontologies, again using the powerful
abstractions provided by category theory.
logic level Our semantics is given for the ontology language OWL, but due to the
abstraction power of the framework, it easily carries over to other logics used in
ontology engineering, like RDFS, rst-order logic or F-logic.</p>
      <p>This shows that category theory is not only a powerful abstraction at the semantic
level, but can properly guide language design and tool implementations and thus
provide useful abstraction barriers from a software engineering point of view.</p>
      <p>
        The distributed ontology language DOL is a metalanguage in the sense that it
enables the reuse of existing ontologies as building blocks for new ontologies using a
variety of structuring techniques, as well as the specication of relationships between
ontologies. One important feature of DOL is the ability to combine ontologies that
are written in dierent languages without changing their semantics. A formal
specication of the language can be found in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. However note that syntax and semantics
of DOL alignments is introduced in this paper for the rst time.
1 We do not claim here that the reasoning methods we provide outperform more specialised
alignment reasoning methods, say for DDL, or alignment debugging: our main
contribution is the provision of a unifying framework that works simultaneously at the various
levels.
      </p>
      <p>The general picture is then as follows: existing ontologies can be integrated as-is
into the DOL framework. With our new extended DOL syntax, we can specify dierent
kinds of alingments. From such an alignment, we construct a graph of ontologies and
morphisms between themin a way depending on the chosen alignment framework.
Sometimes, this step also involves transformations on the ontologies, such as
relativisation of the (global) domain using predicates. A network of alignments can then
be combined to an integrated alignment ontology via a so-called colimit. Reasoning
in a network of aligned ontologies is then the same as reasoning in the combined
ontology. Thus, in order to implement a reasoner, it is in principle sucient to dene
the relativisation procedure for the local logics and the alignment transformation for
each kinds of semantics.
3</p>
      <p>
        Networks of ontologies and their semantics
In this section we recall networks of ontologies and their semantics introduced in [
        <xref ref-type="bibr" rid="ref23 ref8">23,
8</xref>
        ]. Networks of ontologies (here denoted NeO) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], called distributed systems in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ],
consist of a family (Oi)i2I of ontologies over a set of indexes I interconnected by a
set of alignments (Aij )i;j2I between them. Alignments are sets of correspondences
between the target ontology O1 and source ontology O2 of the alignment.
Correspondences are triples (e1; e2; R) where e1 and e2 are entities built with the help of an
entity language over O1 and O2, respectively, and R is a relation between entities
from a set of relations R.
      </p>
      <p>A semantics of networks of ontologies is given in terms of local interpretation of
the ontologies and alignments it consists of. To be able to give such a semantics, one
needs to give an interpretation of the relations between entities that are expressed in
the correspondences. In the following three subsections let S = f(Oi)i2I ; (Aij )i;j2I g
be a NeO over a set of indexes I.</p>
      <p>Smiamntpicles, sthemeaasnstuimcsptiIonn tihsethsaimtpallle osne-- O1 O2 : : : On
tologies are interpreted over the same m1 m2 mn
domain (or universe of interpretation) !( D w
D. The relations in R are interpreted
as relations over D, and we denote the interpretation of R 2 R by RD.</p>
      <p>If O1, O2 are two ontologies and c = (e1; e2; R) is a correspondence between
O1 and O2, we say that c is satised by interpretations m1, m2 of O1, O2 i
m1(e1) RD m2(e2). This is written m1; m2 j=S c. A model of an alignment A between
ontologies O1 and O2 is then a pair m1, m2 of interpretations of O1, O2 such that for
all c 2 A, m1; m2 j=S c. We denote this by m1; m2 j=S A. An interpretation of S is a
family (mi)i2I of models mi of Oi. A simple interpretation of S is an interpretation
(mi)i2I of S over the same domain D.</p>
      <p>
        Denition 1. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] A simple model of a S is a simple interpretation (mi)i2I of S
such that for each i; j 2 I, mi; mj j=S Aij . This is written (mi)i2I j=S S. We denote
by M odsim(S) the class of all simple models of S.
      </p>
      <p>Integrated Semantics Another pos- O1 O2 : : : On
sibility is to consider that the domain
of interpretation of the ontologies of a m m2 mn
NeO is not constrained, and a global D1 D2 : : : Dn
gdeotmhearinwoitfhinatfearmprielytaotifonequUaliesxinisgtsf,untco-- 1 2 n
tions i : Di ! U , where Di is the do- !( U w
main of Oi, for each i 2 I. A relation R in R is interpreted as a relation RU on
the global domain. Satisfaction of a correspondence c = (e1; e2; R) by two models
m1 of O1 and m2 of O2 means that i(mi(e1))RU j (mj (e2)). We denote this by
m1; m2 j=I1; 2 c and by m1; m2 j=I1; 2 A we denote that m1; m2 j=I1; 2 c for each
c 2 A.</p>
      <p>
        An integrated interpretation of S is then f(mi)i2I ; ( i)i2I g where (mi)i2I is an
interpretation of S and i : Di ! U is a function to a common global domain U for
each i 2 I. We here assume that the i are inclusions.2
Denition 2. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] An integrated interpretation f(mi); ( i)g of S is an integrated
model of S i for each i; j 2 I, mi; mj j=Ii; j Aij . We denote by M odint(S) the class
of all integrated models of a NeO S.
      </p>
      <p>
        Contextualised Semantics The func- O1 O2 : : : On
tional notion of contextualised
semantics in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] is not very useful and has m m2 mn
tbieoennalrneoptliaocnedsubbyseqauemnotrlye [8ex],ibclloeserleylar-e- D1 i r1;2 / rD1;23 r2;3 / ;: : : Dn
lated to the semantics of DDLs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and rn;1
E -connections [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>The idea is to relate the domains of the ontologies by a family of relations r =
(rij )i;j2I . The relations R in R are interpreted in each domain of the ontologies in
the NeO. Satisfaction of a correspondence c = (e1; e2; R) by two models m1 of O1 and
m2 of O2 means that mi(e1)Rirji(mj (e2)), where Ri is the interpretation of R in Di.
We denote it by m1; m2 j=rC c, and extend this to alignments, denoted m1; m2 j=rC A
if all correspondences of the alignment are satised by m1; m2 w.r.t. r.</p>
      <p>A contextualised interpretation of S is a pair f(mi)i2I ; (rij )i;j2I g where (mi)i2I
is an interpretation of S and (rij )i;j2I is a family of domain relations such that rij
relates the domain of mi to the domain of mj and rii is the identity (diagonal)
relation. Further assumptions about domain relations can be added, thus restricting
more the class of interpretations of a NeO.</p>
      <p>Denition 3. A contextualised model of the NeO S is a contextualised interpretation
((mi)i2I ; (rij )i;j2I ) of S such that for each i; j 2 I, mi; mj j=rC Aij . We denote by
M odcon(S) the class of all contextualised models of a NeO S.
2 The theory also works for injections without much change. Arbitrary, i.e. possibly
noninjective maps, are conceptually not necessary: a local model can be quotiented by the
kernel of a non-injective such map, and then be replaced by the quotient, leading to an
injective map again.</p>
    </sec>
    <sec id="sec-3">
      <title>DOL Alignments</title>
      <p>In this section we start by introducing the DOL concepts necessary for giving
semantics of alignments. We then introduce the syntax of alignments in DOL and illustrate
with the help of an example involving OWL ontologies how the semantics of
alignments can be given using diagrams and colimits. We then present the main result
of the paper, showing how the categorical semantics of DOL alignments captures the
three semantics of networks of ontologies.
4.1</p>
      <p>DOL Diagrams and Combinations</p>
      <sec id="sec-3-1">
        <title>The syntax for specifying diagrams in DOL is</title>
        <p>graph D = D1; : : : ; Dm; O1; : : : ; On; M1; : : : ; Mp; A1; : : : ; Ak
where Di are (sub-)diagrams, Oi are ontologies, Mi are morphisms and Ai are
alignments. The user species a diagram D formed with the subgraphs given by diagrams
Di, extended with ontologies Oi and the morphisms Mi and the subdiagrams of the
alignments Ai</p>
        <p>DOL also provides means for combining a diagram of ontologies into a new
ontology, such that the symbols related in the diagram are identied. The syntax of
combinations is ontology O = combine D , where D is a diagram, named or
specied as above. The semantics of a combination O is the class of models of the colimit
ontology of the diagram specied in the combination. Under rather mild technical
assumptions, this model class captures exactly the models of the diagram.
4.2</p>
        <p>
          Syntax of DOL Alignments
DOL represents the general alignment format in a similar way to the Alignment API
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] as follows:
al ig nm en t A : O1 to O2 =
s11 REL1 s12 , : : :, s1n RELn s2n
assuming DOMAIN
end
where O1 and O2 are the ontologies to be aligned, si1 and si2 are O1 and
respectively O2 symbols, for i = 1; : : : ; n, si1 RELi si2 is a correspondence which identies
a relation between the ontology symbols, using one of the symbols &gt; (subsumes), &lt;
(is subsumed), = (equivalent), % (incompatible), 2 (instance) or 3 (has instance)
and DOMAIN records whether single, integrated or contextualised semantics is used,
using the constant SingleDomain, GlobalDomain and ContextualisedDomain
respectively.
        </p>
        <p>Before starting to analyse the three semantics for NeOs in our setting, we can
rst dene the diagram of a NeO in terms of the diagrams of its parts.
Denition 4. The diagram of a NeO S = f(Oi)i2I ; (Aij )i;j2I g is obtained by putting
together the diagrams of all alignments Aij it consists of.</p>
        <p>The gap to be lled is the construction of the diagram associated with a single
assignment, in all three possible assumptions about the semantics. Once this has been
given, we can dene the semantics of a NeO as the colimit ontology of its associated
diagram.</p>
        <p>Example 1. We illustrate the three approaches to semantics with the help of a simple
example. Let us consider the following two ontologies:
ontology S = Class: Person</p>
        <p>Individual: alex Types: Person</p>
        <p>Class: Child
ontology T = Class: HumanBeing</p>
        <p>Class: Male SubClassOf: HumanBeing</p>
        <p>Class: Employee
together with the following correspondences: S:Person = T:HumanBeing, S:alex 2
T:Male and S:Child v : T: Employee.</p>
        <p>Using the AlignmentAPI syntax, we can write this alignment as
alignment A : S to T = Person = HumanBeing,
alex 2 Male,</p>
        <p>Child &lt; : Employee</p>
        <p>The assumption about the domains of S and T, which determines which of the
three semantics is used, is left to be added in the specication of A.</p>
        <p>In all three cases, the semantics of the alignment is the class of models of the
colimit of the diagram of the alignment, which can be specied in DOL by writing
ontology C = combine A .
4.3</p>
        <p>
          Simple Semantics
In this simplest case, we simply turn the correspondences into OWL sentences to
generate the bridge ontology. Moreover, for each entity occuring in an alignment
we want to use both its axiomatisation in the original ontology as well as the bridge
axioms introduced by the alignment. For this reason, we keep track of the dependency
between the symbols of the bridge ontology and the ontology they have origin from
by adding a common source in the diagram for these two occurences. This is a
wellknown construction, see [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
        </p>
        <p>
          Denition 5. Let A be an alignment (using the notations of Sec. 4.2). The diagram
of the alignment is of the following shape (a W-alignment in the sense of [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]):
O1
        </p>
        <p>O2</p>
        <p>B</p>
        <p>Bridge
O1'</p>
        <p>O2'
Its constituents are obtained as follows. The ontologies O10 and O20 collect, respectively,
all the symbols s1 and s2 that appear in a correspondence s1REL s2 in A, and have
no sentences. The morphisms i from Oi0 to Oi, where i = 1; 2, are inclusions. The
ontology B is constructed by turning the correspondences of the alignment into OWL
axioms. The morphisms 1 and 2 map the symbols occurring in correspondences to
their counterpart in B. The alignment is ill-formed when it contains an equivalence
between symbols of dierent kinds, or if B fails to be a well-formed ontology.
Example 2. We start by adding the assumption that we have a shared domain for
the ontologies in the alignment of Ex. 1:
alignment A : S to T = : : :</p>
        <p>assuming SingleDomain
where S0 consists of the concepts Person and Child and the individual alex and T 0
consists of the concepts HumanBeing, Employee and Male, 1 and 2 are inclusions
and 1 and 2 map, respectively, Person and HumanBeing to Person_HumanBeing
and all other concepts and/or individuals identically.</p>
        <p>The bridge ontology B is:
ontology B = Class: Person_HumanBeing</p>
        <p>Class: Employee
Class: Male
Class: Child SubClassOf: : Employee</p>
        <p>Individual: alex Types: Male
The colimit ontology of the diagram of A is:
ontology C = Class: Person_HumanBeing</p>
        <p>Class: Employee
Class: Male SubClassOf: Person_HumanBeing
Class: Child SubClassOf: : Employee</p>
        <p>Individual: alex Types: Male ; Person_HumanBeing
4.4</p>
        <p>
          Integrated Semantics
Capturing integrated semantics in DOL using families of models compatible with a
diagram is more dicult, as compatibility with the diagram implies uniqueness of
the domain. To remedy this, we use relativisation of an ontology where the universal
concept becomes a new concept and thus can be interpreted as a subset of the
relativised domain. Relativisations have previously been used in dening Common Logic
modules [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] or in the re-encoding of DDL into OWL [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>Denition 6. Let O be an OWL ontology. We dene the relativisation of O, denoted
O~, as follows. The concepts of O~ are the concepts of O together with a new concept,
denoted &gt;O. The roles and individuals of O~ are the same as in O. O~ contains axioms
stating that
each concept C of O is subsumed by &gt;O,
each individual i of O is an instance of &gt;O,
each role r has its domain and range, if present, intersected with &gt;O, otherwise
they are &gt;O.
and the axioms of O where the following replacement of concepts is made:
each occurence of &gt; is replaced by &gt;O, and
each concept :C is replaced by &gt;O u :C
each concept 8R:C is replaced by &gt;O u 8R:C.</p>
        <p>Example 3. We add the assumption that we have a global domain where the domains
of the ontologies in our alignment are included:
alignment A : S to T = : : :</p>
        <p>assuming GlobalDomain</p>
      </sec>
      <sec id="sec-3-2">
        <title>The diagram of A is then</title>
        <p>~
S _
~
? B _
1</p>
        <p>1
S0
2</p>
        <p>2
~
? T
where S0 consists of the concepts T hingS , Person and Child and the individual
alex and T 0 consists of the concepts T hingT , HumanBeing, Employee and Male, 1
and 2 are inclusions and 1 and 2 map Person and respectively HumanBeing to
Person_HumanBeing and all other concepts and/or individuals identically.</p>
        <p>The relativisations S~ and T~ of the ontologies S and T are
ontology S~ = Class: T hingS</p>
        <p>Class: Person SubClassOf: T hingS
Individual: alex Types: Person, T hingS</p>
        <p>Class: Child SubClassOf: T hingS
ontology T~ = Class: T hingT</p>
        <p>Class: HumanBeing SubClassOf: T hingT
Class: Male SubClassOf: HumanBeing, T hingT</p>
        <p>Class: Employee SubClassOf: T hingT</p>
        <p>The relativised bridge ontology of an alignment is built by relativising the axioms
that result from translating the correspondences of A to OWL sentences. Since we
made the assumption that equalising functions are all inclusions, there is no need to
introduce explicit symbols for them in the bridge ontology. In our case, the bridge
ontology of A is
ontology B~ = Class: T hingS Class: T hingT</p>
        <p>Class: Person_HumanBeing SubClassOf: T hingS, T hingT
Class: Male Class: Employee
Class: Child SubClassOf: T hingT and : Employee</p>
        <p>Individual: alex Types: Male</p>
        <p>The colimit ontology of the relativised diagram of the alignment in Ex. 1 is:
ontology C = Class: ThingS</p>
        <p>Class: ThingT
Class: Person_HumanBeing SubClassOf: ThingS, ThingC
Class: Male SubClassOf: Person_HumanBeing
Class: Employee SubClassOf: ThingT
Class: Child SubClassOf: ThingS
Class: Child SubClassOf: ThingT and : Employee</p>
        <p>Individual: alex Types: Male, Person_HumanBeing
4.5</p>
        <p>Contextualised Semantics
Here we need to introduce explicitly the relations between the domains in the
language of the bridge ontology. The diagram of the alignment has thus the same shape
as in Def. 5, but now the bridge ontology is computed dierently and, as in the
previous section, the ontologies are relativised. We denote the bridge ontology by B and
dene it to modify B as follows:
rji is added to B as a role with domain &gt;T and range &gt;S
the correspondences are translated to axioms involving these roles:</p>
        <p>Ci = Cj becomes Ci 9rji Cj
ai = aj becomes ai rji aj
ai 2 Cj becomes ai 2 9rji Cj
Ci &lt; Cj becomes Ci v 9rji Cj</p>
        <p>Ci%Cj becomes Ci u 9rji Cj = ;
the properties of the rji are added as axioms in B.</p>
        <p>Here we assume that the alignment Aij contains no correspondence (ri; rj ; R),
where ri and rj are roles. Having such correspondences leads to sentences that cannot
be expressed in OWL.</p>
        <p>Example 4. We add the assumption that we have dierent domains for the ontologies,
which are related by domain relations:
alignment A : S to T = : : :</p>
        <p>assuming ContextualisedDomain
The diagram of A is then
~
S _</p>
        <p>? B _
1</p>
        <p>1
S0
2</p>
        <p>2
~
? T
where the constituents of the diagram, except B, are as dened in Ex. 3. The bridge
ontology of A now becomes:
ontology B = Class: ThingS</p>
        <p>Class: ThingT
ObjectPropery: rT S Domain: ThingT Range: ThingS
Class: Person EquivalentTo: rT S some HumanBeing
Class: Employee
Class: Male
Class: Child SubClassOf: rT S some : Employee</p>
        <p>Individual: alex Types: rT S some Male
The colimit ontology of this diagram is:
ontology C = Class: ThingS</p>
        <p>Class: ThingT
ObjectPropery: rT S Domain: ThingT Range: ThingS
Class: Person EquivalentTo: rT S some HumanBeing
Class: Male SubClassOf: Person_HumanBeing
Class: Employee
Class: Child SubClassOf: rT S some : Employee</p>
        <p>Individual: alex Types: rT S some Male, Person
4.6</p>
        <p>The three semantics in DOL
In this section let S = ((Oi)i2I ; (Aij )i;j2I ) be a network of OWL ontologies. We
denote C(S) the colimit ontology of the diagram associated to S, regardless if the
assumption about the alignments in S is that they use single, integrated or
contextualised semantics. The model class of C(S) is denoted JC(S)K.</p>
        <p>Theorem 1. 1. If the alignments of S use SingleDomain and the diagram of S is
connected, then JC(S)K is in bijection with M odsim(S).
2. If the alignments of S use GlobalDomain , then JC(S)K is in bijection with the
class M odint(S) of integrated models ((mi); ( i)) of S where i are inclusions.
3. IwfitthheMaolidgcnomn(eSn)ts. of S use ContextualisedDomain , then JC(S)K is in bijection</p>
        <p>
          DOL is supported by Ontohub ( https://ontohub.org ), a Web-based repository
engine for managing distributed heterogenous ontologies. The back-end of Ontohub
is the Heterogeneous Tool Set HETS [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] which is used for parsing, static analysis
and proof management of ontologies. HETS supports alignments and combinations:
it generates the diagram of an alignment according to the assumption on the domain
and can compute colimits of OWL ontologies automatically.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and Future Work</title>
      <p>Our theoretical contributions to the foundations of ontology alignment and
combination have a potentially large impact on future alignment practices and reasoning.
Regardless of the semantic paradigm employed, ‘reasoning’ with alignments involves
at least three levels: (1) the nding/discovery of alignments (often based heavily on
statistical methods), (2) the construction of the aligned ontology (the ‘colimit’), and
(3) reasoning over the aligned result, respectively debugging and repair, closing the
loop to (1). Our contributions in this paper address levels (2) and (3).</p>
      <p>
        Regarding (2), platforms such as Bioportal (with hundred thousands of
mappings) illustrate that mappings between ontologies, ontology modules, and the
concepts and denitions living in them, are of great importance to support re-use. The
importance of alignment has also been well demonstrated for foundational
ontologies in the repository ROMULUS [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. In the case of Bioportal, the DOL language
allows to declaratively manage sets of alignments, and to give precise semantics. In
the case of ROMULUS, it allows to align ontologies such as Dolce or BFO expressed
in rst-order logic with OWL versions of the same ontology.
      </p>
      <p>
        Regarding (3), alignment tools such as LogMap [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and ALCOMO [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] employ
reasoning over aligned ontologies and repair either parts of the input ontologies or
revise the mappings (one technique to enable this is to re-encode the mappings into
a global OWL ontology) to restore global consistency. Using DOL and the reasoning
capabilities of the Hets/Ontohub ecosystem, such tools could be used to directly
operate on a NeO, and to update the diagram structure accordingly.
      </p>
      <p>
        The approach presented here provides an integration of the major paradigms of
ontology alignment in one coherent framework. This includes standard alignment
relations, DDLs, PD-L, IDDL, and E -connections [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] which we currently study in
more detail. Our construction assumes OWL as the local logic of the ontologies;
however it can be generalised to an arbitrary logic by giving a (necessary logic-specic)
relativisation procedure and alignment transformation. Moreover, DOL’s support for
heterogeneity allows us not only to handle heterogeneous alignment, but also to move
to a more expressive logic when a bridge axiom cannot be expressed in the local logic
of the ontologies. Thus we can remove the restriction on correspondences in the
contextualised semantics.
      </p>
      <p>
        Future work includes the combination of dierent alignment paradigms within
one network (as principally enabled by our unifying framework) and an integration
of techniques for the revision of NeOs [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] into DOL. In our setting, the propagation of
detected repairs into a network could be done by updating the alignment mappings
and re-computing the alignment diagrams. Further work is also needed for the
problem of reasoning about the consequences of a NeO; here we expect module extraction
to provide an increase in performance of proof search. At the tool level, the integration
of the three semantics for alignments in Ontohub is currently in progress. Ontohub
is already compatible with the OWL API, and its potential for interoperability is
increased further by the integration of the Alignment API.
      </p>
      <p>Acknowledgements We gratefully acknowledge the nancial support of the Future
and Emerging Technologies (FET) programme within the Seventh Framework
Programme for Research of the European Commission, under FET-Open Grant number:
611553, project COINVENT.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          , G. Voutsadakis, G. Slutzki, and
          <string-name>
            <given-names>V.</given-names>
            <surname>Honavar</surname>
          </string-name>
          , '
          <article-title>Package-based description logics'</article-title>
          ,
          <source>in Modular Ontologies</source>
          ,
          <volume>349371</volume>
          , Springer, (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Borgida</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Serani</surname>
          </string-name>
          , '
          <article-title>Distributed Description Logics: Assimilating Information from Peer Sources'</article-title>
          ,
          <source>Journal of Data Semantics</source>
          ,
          <volume>1</volume>
          ,
          <fpage>153184</fpage>
          , (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>P.</given-names>
            <surname>Bouquet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Giunchiglia</surname>
          </string-name>
          ,
          <string-name>
            <surname>F. van Harmelen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Serani</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Stuckenschmidt</surname>
          </string-name>
          , 'COWL:
          <article-title>Contextualizing ontologies'</article-title>
          ,
          <string-name>
            <surname>in</surname>
            <given-names>ISWC</given-names>
          </string-name>
          , pp.
          <fpage>164179</fpage>
          , (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          , '
          <article-title>Description logics for information integration', in Computational Logic: Logic Programming</article-title>
          and Beyond , eds.,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Sadri</surname>
          </string-name>
          ,
          <source>volume LNCS 2408</source>
          , pp.
          <fpage>4160</fpage>
          . Springer, (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          , '
          <article-title>Logical foundations of peer-to-peer data integration'</article-title>
          , in PODS, eds.,
          <string-name>
            <given-names>C.</given-names>
            <surname>Beeri</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Deutsch</surname>
          </string-name>
          , pp.
          <fpage>241251</fpage>
          . ACM, (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>B.</given-names>
            <surname>Cuenca-Grau</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          , '
          <article-title>Modular Ontology Languages Revisited'</article-title>
          ,
          <source>in Proc. of the IJCAI'07 Workshop on Semantic Web for Collaborative Knowledge Acquisition (SWeCKa)</source>
          , Hyderabad, India,
          <year>January 2007</year>
          , pp.
          <fpage>2231</fpage>
          , (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J.</given-names>
            <surname>David</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Schare</surname>
          </string-name>
          , and
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Trojahn dos Santos, '</article-title>
          <source>The alignment API 4</source>
          .0', Semantic Web,
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <fpage>310</fpage>
          , (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          , Ontology matching, Springer-Verlag, Heidelberg (DE),
          <article-title>2nd edn</article-title>
          .,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>JØrme</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , '
          <article-title>Foundations for revising networks of ontologies'</article-title>
          ,
          <source>in Third International Workshop on Debugging Ontologies and Ontology Mappings-WoDOOM14</source>
          , p.
          <fpage>1</fpage>
          , (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>C.</given-names>
            <surname>Ghidini</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Serani</surname>
          </string-name>
          , '
          <article-title>Distributed rst order logics'</article-title>
          ,
          <source>in Frontiers Of Combining Systems 2, Studies in Logic and Computation</source>
          , pp.
          <fpage>121140</fpage>
          . Research Studies Press, (
          <year>1998</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krtzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Serani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Stuckenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wache</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          , '
          <article-title>Integrated view and comparison of alignment semantics'</article-title>
          , Contrat, (
          <year>December 2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. E.
          <string-name>
            <surname>JimØnez-Ruiz</surname>
            and
            <given-names>B. Cuenca</given-names>
          </string-name>
          <string-name>
            <surname>Grau</surname>
          </string-name>
          , '
          <article-title>LogMap: Logic-based and Scalable Ontology Matching'</article-title>
          ,
          <source>in Proc. of the 10th International Semantic Web Confernece (ISWC</source>
          <year>2011</year>
          ) ,
          <volume>273288</volume>
          , Springer, (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Khan</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Keet</surname>
          </string-name>
          , '
          <article-title>The foundational ontology library ROMULUS'</article-title>
          ,
          <source>in Model and Data Engineering</source>
          ,
          <volume>200211</volume>
          , Springer, (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          , '
          <article-title>E-Connections of Abstract Description Systems'</article-title>
          ,
          <source>Articial Intelligence</source>
          ,
          <volume>156</volume>
          (
          <issue>1</issue>
          ),
          <fpage>173</fpage>
          , (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mossakowski</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Codescu</surname>
          </string-name>
          , '
          <article-title>Shapes of alignments - construction, combination, and computation'</article-title>
          , in International Workshop on Ontologies:
          <article-title>Reasoning and Modularity (WORM-08</article-title>
          ) , eds.,
          <string-name>
            <given-names>U.</given-names>
            <surname>Sattler</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Tamilin</surname>
          </string-name>
          , volume
          <volume>348</volume>
          <source>of CEUR-WS online proceedings</source>
          , (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>C. Meilicke</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Stuckenschmidt</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Tamilin</surname>
          </string-name>
          , '
          <article-title>Repairing ontology mappings'</article-title>
          ,
          <string-name>
            <surname>in</surname>
            <given-names>AAAI</given-names>
          </string-name>
          , volume
          <volume>3</volume>
          , p.
          <fpage>6</fpage>
          , (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>T.</given-names>
            <surname>Mossakowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Codescu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Lange</surname>
          </string-name>
          , '
          <article-title>The Distributed Ontology, Modeling and Specication Language'</article-title>
          ,
          <source>in Proceedings of the 7th International Workshop on Modular Ontologies (WoMO-13)</source>
          , ed.,
          <string-name>
            <given-names>C.</given-names>
            <surname>Del Vescovo</surname>
          </string-name>
          et al., volume
          <volume>1081</volume>
          .
          <string-name>
            <surname>CEUR-</surname>
            <given-names>WS</given-names>
          </string-name>
          , (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Till</surname>
            <given-names>Mossakowski</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Maeder</surname>
          </string-name>
          , and Klaus Lttich, 'The Heterogeneous Tool Set', in TACAS 2007, eds.,
          <source>Orna Grumberg and Michael Huth</source>
          , volume
          <volume>4424</volume>
          of Lecture Notes in Computer Science, pp.
          <fpage>519522</fpage>
          . Springer-Verlag Heidelberg, (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>F.</given-names>
            <surname>Neuhaus</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Hayes</surname>
          </string-name>
          , '
          <article-title>Common Logic and the Horatio problem'</article-title>
          ,
          <source>Applied Ontology</source>
          ,
          <volume>7</volume>
          (
          <issue>2</issue>
          ),
          <fpage>211231</fpage>
          , (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , '
          <article-title>Ontology matching: State of the art and future challenges'</article-title>
          ,
          <source>IEEE Trans. Knowl</source>
          . Data Eng. ,
          <volume>25</volume>
          (
          <issue>1</issue>
          ),
          <fpage>158176</fpage>
          , (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. A. Zimmermann, '
          <article-title>Integrated distributed description logics'</article-title>
          , in Description Logics, eds.,
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Franconi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Haarslev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Motik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Turhan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Tessaris</surname>
          </string-name>
          , volume
          <volume>250</volume>
          <source>of CEUR Workshop Proceedings</source>
          , (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. A. Zimmermann, '
          <article-title>Logical formalisms for agreement technologies'</article-title>
          , in Agreement Technologies, ed.,
          <source>S. Ossowski</source>
          , volume
          <volume>8</volume>
          of Law,
          <source>Governance and Technology Series</source>
          ,
          <volume>6982</volume>
          ,
          <string-name>
            <surname>Springer</surname>
            <given-names>Netherlands</given-names>
          </string-name>
          , (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , '
          <article-title>Three semantics for distributed systems and their relations with alignment composition'</article-title>
          ,
          <source>in Proc. 5th International Semantic Web Conference (ISWC)</source>
          ,
          <source>LNCS 4273</source>
          , pp.
          <fpage>1629</fpage>
          ,
          <string-name>
            <surname>Athens</surname>
          </string-name>
          (GA US), (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krtzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          , '
          <article-title>Formalizing Ontology Alignment and its Operations with Category Theory'</article-title>
          ,
          <source>in Proc. of FOIS-06</source>
          , pp.
          <fpage>277288</fpage>
          , (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>