<!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>On Using Sub jective Logic to Build Consistent Merged Ontologies</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Heinz-Nixdorf Chair for Distributed Information Systems Institute for Computer Science, Friedrich Schiller University Jena</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontologies encode a community's understanding of a domain and are thus subjective. Di erent communities may create di erent models of overlapping domains. If they need to be integrated, this may cause problems: combining subjective knowledge from diverse ontologies into a merged model may make it inconsistent. We provide a Subjective Logic-based approach to support users in creating a consistent merged ontology re ecting a commonly trusted view of the domain.</p>
      </abstract>
      <kwd-group>
        <kwd>Ontology merging</kwd>
        <kwd>Consistency</kwd>
        <kwd>Subjective Logic</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Ontologies represent domain knowledge. They are subjective with regards to
the creators' view of the domain. This can cause problems, when ontologies
need to be merged: while each of them models a consistent view of the
world, their combination may be inconsistent. Whereas inconsistencies in single
ontologies that result from modeling errors are comparatively easy to resolve
automatically [
        <xref ref-type="bibr" rid="ref10 ref8">8,10</xref>
        ], inconsistencies that arise due to di ering views of the world
are di cult to deal with. In order to resolve them, the subjective beliefs about
the world and how trustworthy they are need to be taken into consideration.
      </p>
      <p>
        A formal approach to capture beliefs and trustworthiness is Subjective
Logic [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which consists of a belief model called opinion and a set of
operations for combining opinions. It is applicable in situations with considerable
uncertainty and incomplete knowledge. This formalism has been successfully
applied to a number of Semantic Web related tasks, e.g., for ontology
alignment [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], recommendation systems [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and inconsistency handling in single
ontology development environments [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>We propose to use Subjective Logic theory for inconsistency resolution in
ontology merging. More precisely, the problem that we are addressing is the
following: Given an inconsistent ontology that is the result of merging several
consistent source ontologies, determine which changes should be made to make
the ontology consistent. These changes should preserve the most trusted point
of view on the shared domain. A rst evaluation shows that this approach is
promising.</p>
    </sec>
    <sec id="sec-2">
      <title>Applying Subjective Logic to Achieve Consistency</title>
      <p>
        We call an ontology O inconsistent i there is no model of O, i.e., O is
unsatis able [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. A rst step to resolving inconsistency in a merged ontology
is to pinpoint its origin. To do so, the ontology is evaluated using an
o -the-shelf reasoner. If the consistency test fails, the con icting axioms set
that cause inconsistencies are extracted using the reasoner. In the next step,
the trustworthiness of each axiom is computed using our Subjective Logic-based
approach. For the least trustworthy axioms, a suggested revised axioms' set
(following the approach from [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]) will be represented to the user.
      </p>
      <p>
        Subjective Logic. Subjective opinions express beliefs of agents about the
truth of propositions with degrees of uncertainty [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. In our approach we use
binary subjective logic and regard the source ontologies as agents, as they
represent their communities' beliefs about the domain. Let P be a proposition
such as \Axiom x is trustworthy in the merged ontology OM ". Following [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
the opinion w of agent Oi about the proposition P is equivalent to a beta
distribution for the information source x as the combination of belief bxOi ,
disbelief dxOi , uncertainty uxOi , and base rate (atomicity) aOi with a tuple
x
wxOi = (bxOi ; dxOi ; uxOi ; axOi ), where bOi + dOi + uOi = 1.
      </p>
      <p>x x x</p>
      <p>Opinions are formed on the basis of positive r and negative s evidence about
x available to agent Oi. Then, bxOi ; dxOi , and uxOi are:
bOi =
x
rOi
x
rxOi + sxOi + W
; dOi =
x
sOi
x
rxOi + sxOi + W
; uOi =
x</p>
      <p>W
rxOi + sxOi + W
(1)
where, W is the default non-informative prior weight that in binomial opinions is
de ned as W = 2. Thus, the opinion's probability expectation value is computed
by txOi = bxOi + axOi uxOi as the trustworthiness of x by agent Oi. This requires
that we determine rxOi , sOi (to calculate bxOi ; dxOi ; uxOi ) and axOi .</p>
      <p>x</p>
      <p>Positive and negative evidence. To determine the positive evidence r of
an axiom xj , we use provenance information. Each axiom in OM is derived from
one or several input ontologies Oi. Therefore, r for xj from agent Oi is calculated
in Eq. 2 as (i) the existence of axiom xj in Oi (provenance information), and (ii)
the impact of the axiom's elements (e ect ), to re ect how much the ontology
gets a ected if axiom xj is altered. By axiom's elements, we mean those elements
which are involved in an axiom, e.g., A and B in the axiom x1 : A v B. To
this end, we determine how often elements of axiom xj have been referenced
in other axioms in the ontology. Let c(Oi) be the total number of axioms in
Oi and cxj (Oi) be the number of axioms in Oi that contain elements of xj .
Then fxj (Oi) = cxcj( O(Oi)i) is the fraction of axioms in Oi that contain elements of
xj . The provenance of the axioms is represented by the and parameters; if
xj 2= Oi, but the elements of the axioms exist in Oi, then fxj (Oi) multiplies with
, otherwise, it multiplies with .</p>
      <p>rxOji =
(
fxj (Oi) if xj 2 Oi
fxj (Oi) if xj 2= Oi
(2)</p>
      <p>
        A justi cation is a minimal subset of an ontology that causes it to be
inconsistent. Let O be an ontology entailing axiom x ( O j= x). J is a justi cation
for x in O if J O, and J j= , and for all J 0 ( J J 0 2 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The ontology
justi cation set J is the set of all justi cations, J = fJ1; J2; :::; Jlg, where there
may be multiple, potentially overlapping justi cations in J . Each justi cation
Jk 2 J includes several axioms, denoted by Jk = (x1; x2; :::; xz). In this follow,
to determine the negative observations s, we use the axiom frequency cxj (J ) in
the justi cation set J divided by the number of the con icting axioms set that
cause inconsistencies c(X) which belong to Oi in Eq. 3 (to re ect the view of
Oi). This metric is already used in the [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], to accelerate the process of getting
rid of unsatis able concepts.
      </p>
      <p>sxOji =
cxj (J )
c(X)</p>
      <p>
        Base Rate. In the absence of evidence for belief, disbelief, and uncertainty,
the base rate plays an important role. It re ects prior knowledge about the
phenomenon at hand. In our case, using the centrality measure [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] of elements
exj seems a suitable indicator. The base rate for axiom xj with t elements xj =
fe1; e2; :::; etg is given by Eq. 4. This is determined by the number of super- and
subclasses of the elements divided by the total number of elements jej in Oi.
axOji =
      </p>
      <p>1
jej 2 Oi</p>
      <p>t
X jSubClass(ek) [ SuperClass(ek)j; ek 2 xj
k=1
(3)
(4)</p>
      <p>
        Combining Opinions and Conditional Opinions. The Subjective Logic
operator consensus [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] combines the opinions in such a way, that the more
trustworthiness opinions will be those that are agreed upon by multiple agents.
Let wxO1 = (bxO1 ; dxO1 ; uxO1 ; axO1 ) and wxO2 = (bxO2 ; dxO2 ; uxO2 ; axO2 ) be opinions
respectively held by O1 and O2 about the same proposition x. Then the
consensus for these two opinions is wxO1O2 = wxO1 wxO2 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], it re ects the
opinion of an imaginary agent representing both O1 and O2. In principle, this
operator can be used in our approach to combine opinions by di erent agents
and reach a consensus.
      </p>
      <p>
        However, this would have a drawback: it does not consider the e ect of
the calculated ranked values for axioms in Jk on Jl, k 6= l. To overcome
this issue, we use conditional theory of Subjective Logic [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which re ects the
e ect of the dependent opinions. Let us consider an example: J = fJ1; J2; J3g
is a set of justi cations, where axioms are repeated in multiple J s, as J =
f(x1; x2; x3); (x4; x5; x6; x7); (x3; x4; x5; x7; x8)g. The opinions for J1's axioms
can be calculated as independent opinions. However, some elements of J3 have
already obtained some ranked values from J1 and J2. Here, we can use the
previous ranked values from J1 and J2 for x3; x4; x5; x7 in J3, but it might
happen that these axioms compared to the remaining axioms in J3 get di erent
ranked values. Therefore, in an incremental process, we calculate a new value in
each J , but we also consider the e ect of the previous ranked values for axioms
in other J s. Thus, we enrich our method by using the conditional deduction
operator } introduced in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] to express this.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>
        To handle inconsistencies in one ontology, various researches such as [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] have been
done, where the authors ranked the justi cation with a single metric. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ],
Subjective Logic is used to solve ontology inconsistencies in a single ontology
process, not applying Subjective Logic to ontologies merging process, where the
agent's opinions from the input ontologies play a serious role. Moreover, no
agent's opinion combination has been considered, and the authors only utilized
the atomicity value and omitted the belief, disbelief and uncertainty values. To
deal with multiple ontologies, the authors in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] considered multiple ontologies
that are networked via mappings for distributed environments, only. To the
best of our knowledge, this is the rst work that by using the Subjective Logic
theory considers the knowledge of input sources to handle the inconsistencies on
a merged model. As a whole, we di er from other works in three key respects:
we solve inconsistencies in the ontology merging process; we combine several
criteria to rank the con icting axioms set that cause inconsistencies with belief,
disbelief and atomicity values; we consider the combination of agents' opinions
and we employ conditional ranking when the con icting axioms are dependent.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Preliminary Evaluation</title>
      <p>
        As a preliminary evaluation, the proposed work ow has been implemented
within our merge framework [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] 1. We conducted a series of tests 2 on the
OAEI benchmark 3. Table 1 shows the TBox T and Abox A size of the
merged ontologies. In a rst step, we use the reasoner to determine whether the
merged ontology is consistent (PASSED) or not (FAILED). For the ontologies
1 http://comerger.uni-jena.de/
2 on Intel Core i7 with 12 GB internal memory; Pellet reasoner;
3 http://oaei.ontologymatching.org/
= 1,
= 0:5
that do not pass the consistency check, we then determine the unsatis able
classes Cun and the justi cation set J . Afterwards, our method processes all
axioms c(X) of the justi cation set, and ranks them. Table 1 shows the size
of Cun; J and c(X) for each inconsistent merged ontology. The axioms with
the lowest trustworthiness are presented to the user together with a suggested
resolution. The rightmost columns of the table show the runtime (in millisecond)
for detecting the inconsistencies (i.e., extracting Cun; J and c(X)), ranking and
generating the resolution plan respectively. Given that ontology merging is a
complex, time consuming task overall, they seem acceptable.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>We propose a novel approach using Subjective Logic to estimate the
trustworthiness of axioms that cause inconsistencies within a merged ontology.
We use provenance information and structural relevance to assess the opinions
of the input ontologies. With the consensus operator, con icting opinions can
be combined. Moreover, we adopted conditional theory in the Subjective Logic
to re ect the opinion of an axiom which is dependent on another opinion. A
rst evaluation shows that the approach is promising. A pretty straightforward
extension of this work that we are pursuing already, is to determine root causes of
inconsistencies and restrict the approach to those. Also, using domain knowledge
might improve the estimation of an opinion's probability expectation.</p>
      <p>Acknowledgments. S. Babalou is supported by a scholarship from German Academic
Exchange Service (DAAD).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Algergawy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Babalou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Kargar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Davarpanah</surname>
          </string-name>
          .
          <article-title>Seecont: A new seeding-based clustering approach for ontology matching</article-title>
          .
          <source>In ADBIS</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>McGuinness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and D.</given-names>
            <surname>Nardi</surname>
          </string-name>
          .
          <article-title>The description logic handbook: Theory, implementation and applications</article-title>
          . Cambridge university press,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>S.</given-names>
            <surname>Babalou</surname>
          </string-name>
          .
          <article-title>Holistic multiple ontologies merging</article-title>
          .
          <source>In Proc. of the EKAW2018</source>
          co
          <article-title>-located with the 21st (EKAW 2018)</article-title>
          .,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>M.</given-names>
            <surname>Horridge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , and
          <string-name>
            <given-names>U.</given-names>
            <surname>Sattler</surname>
          </string-name>
          .
          <article-title>Explaining inconsistencies in owl ontologies</article-title>
          .
          <source>In SUM</source>
          , pages
          <volume>124</volume>
          {
          <fpage>137</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Haase</surname>
          </string-name>
          , G. Qi,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          , and
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Stadtmuller. Radon|repair and diagnosis in ontology networks</article-title>
          .
          <source>In ESWC</source>
          , pages
          <volume>863</volume>
          {
          <fpage>867</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. A. J sang.
          <source>Subjective logic</source>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>K.</given-names>
            <surname>Juszczyszyn</surname>
          </string-name>
          .
          <article-title>A subjective logic-based framework for aligning multiple ontologies</article-title>
          .
          <source>In KES</source>
          , pages
          <volume>1194</volume>
          {
          <fpage>1200</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>A.</given-names>
            <surname>Kalyanpur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , E. Sirin, and
          <string-name>
            <given-names>B.</given-names>
            <surname>Cuenca-Grau</surname>
          </string-name>
          .
          <article-title>Repairing unsatis able concepts in owl ontologies</article-title>
          .
          <source>In ESWC</source>
          , pages
          <volume>170</volume>
          {
          <fpage>184</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>G.</given-names>
            <surname>Pitsilis</surname>
          </string-name>
          and
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Knapskog</surname>
          </string-name>
          .
          <article-title>Social trust as a solution to address sparsity-inherent problems of recommender systems</article-title>
          .
          <source>arXiv preprint arXiv:1208.1004</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>M. Sensoy</surname>
            ,
            <given-names>J. Z.</given-names>
          </string-name>
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fokoue</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Srivatsa</surname>
            , and
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Meneguzzi</surname>
          </string-name>
          .
          <article-title>Using subjective logic to handle uncertainty and con icts</article-title>
          .
          <source>In TrustCom</source>
          , pages
          <volume>1323</volume>
          {
          <fpage>1326</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>