<!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>
      <journal-title-group>
        <journal-title>C R size
SYN</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Structure-guiding Modular Reasoning for Expressive Ontologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Changlong Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xiaowang Zhang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhiyong Feng</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science and Engineer Technology</institution>
          ,
          <addr-line>NWNU, Lanzhou</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Computer Science and Technology, Tianjin University</institution>
          ,
          <addr-line>Tianjin</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Software, Tianjin University</institution>
          ,
          <addr-line>Tianjin</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Tianjin Key Laboratory of Cognitive Computing and Application</institution>
          ,
          <addr-line>Tianjin</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <volume>14</volume>
      <issue>462</issue>
      <abstract>
        <p>We propose a technique that combine an OWL 2 EL reasoner with an OWL 2 reasoner to classify expressive ontologies. We exploit the information implied by the ontology structure to identify a small non-EL ontology that contains necessary axioms to ensure the completeness. In the process of ontology classification, the bulk of workload is delegated to an e cient OWL 2 EL reasoner and the small part of workload is handled by a less e cient OWL 2 reasoner. Experimental results show that our approach leads to a reasonable task assignment and o ers a substantial speedup in ontology classification.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <sec id="sec-1-1">
        <title>In practical applications, many commonly used ontologies are covered by the OWL 2</title>
        <p>
          EL to a large degree, e.g., of the 226038 axioms in the version V14.03e of NCI ontology,
only 67 are outside the OWL 2 EL fragment. The tableau-based OWL 2 reasoners are
able to reasoning such ontologies, but they are not e cient due to the high complexity
of tableau algorithms for expressive ontologies. The profile-specific OWL 2 EL
reasoners are e cient, but they become incomplete if the ontologies contain axioms that
are outside the OWL 2 EL fragment. Recently, new approaches have been proposed
to improve the reasoning performance for expressive ontologies by combining di
erent reasoners [
          <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
          ]. However, the approach [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] needs to represent an ontology in the
decomposed form [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and the modular reasoner MORe [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] is less e cient because it
delegates much work to the ine cient tableau-based OWL 2 reasoner. In this study, we
exploit the information implied by the ontology structure [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] to identify a small non-EL
subontology that is handled by a less e cient OWL 2 reasoner.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Ontology Structure Induced by Modules. A module is a subset of an ontology that</title>
        <p>
          captures all the knowledge about a specified signature . The ?-module is one basic
type of locality-based modules (LBMs) and enjoys the following property that can be
used for optimising classification [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]:
Proposition 1. Let O be a SROIQ ontology, A; B concept names in Oe, Oe with
A 2 , and M a ?-module in O w.r.t. . Then O j= A v B if and only if M j= A v B.
        </p>
        <sec id="sec-1-2-1">
          <title>A ?-module w.r.t. is denoted by M?. Di erent axioms might lead to the same</title>
          <p>
            module due to the strong logical interrelation among axioms, such axioms that “cling
together” is formalised by the notion of atom [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]:
Definition 1. Given an ontology O, and an axiom set at=f 1; 2; :::; ng O, if M?1 =
Mf?2 =,...,= Mf?n , and for any 2 O n at,Me? , M?ei (i=1,2,...,n). then at is calledfan
?-atom, denoted by at?.
          </p>
        </sec>
      </sec>
      <sec id="sec-1-3">
        <title>For any module, it either contains all axioms in an atom or none of them. The family</title>
        <p>of atoms of O is denoted by AD?O. For each atom at 2 AD?O, the module M? is denoted
at
by Mat and the dependent relation between atoms is induced as follows: e
Definition 2. Let at1 and at2 be two atoms in AD?O, at1 is dependent on at2 (written
at1 at2) if Mat2 Mat1 .</p>
      </sec>
      <sec id="sec-1-4">
        <title>The atomic decomposition (AD) of an ontology O is a pair (AD?; ), denoted by</title>
        <p>O</p>
        <sec id="sec-1-4-1">
          <title>AD?O; , in which AD?O is the set of atoms and is a partial order over those atoms. The</title>
          <p>union of all atoms on which a given atom at depends is called principal ideal of at
( denoted by (at] ).</p>
          <p>
            Proposition 2. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] Let at be an atom in AD?O; , the principal ideal (at] is a module.
Proposition 3. [3, Remark 3.10] For each atom at, Mat coincides with (at] and Mat is
the smallest module containing at.
at j
          </p>
          <p>An atom ati is called a top atom if there exists no a distinct atom at j such that
ati. Hence an ontology O is the union of several independent modules:
O = [ f(tat] j tat is a top atomg
(1)
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Modular Reasoning</title>
      <p>AD represents the modular structure of an ontology, the information implied by this
structure (especially Proposition 2, Proposition 3, and Equation 1) provide us with two
important clues for optimising modular classification: Firstly, for two distinct atoms
at1 and at2 with at1 at2, (at2] is enough to completely classify all the classed in the
module (at2]. Secondly, if not each top atom contains non-EL axioms, it is possible to
identify a small non-El module and delegate it to an OWL 2 reasoner for computing
the subsumption relation of the following form: (1) A v B (2) A u B v C (3) A v</p>
      <sec id="sec-2-1">
        <title>Structure-guiding Modular Reasoning for Expressive Ontologies 3 // computing the non-EL subontology</title>
        <p>AR.classify(MEL) //classifying the non-EL subontology
MR.classify(HMEL [ O n MEL)</p>
      </sec>
      <sec id="sec-2-2">
        <title>Algorithm 1 modularClassification</title>
      </sec>
      <sec id="sec-2-3">
        <title>Input: an ontology O</title>
        <p>Output: HO: the classification of O
1: MEL ;, HMEL ;, HO ;
2: for each 2 S na do
3: if &lt; MEL then
4: MEL MEL S M
5: end if
6: end for
7: if MEL = O then
8: HO AR.classify(O)
9: else
10: HMEL
11: HO
12: end if
13: return HO
9R:B (4) 9R:A v B (5) R v S (6) A u 9R:B v C (7) 9R:A u 9S :B v C
where A, B, and C are atomic concepts or &gt;, and R; S atomic roles. Obviously, these
subsumption relations fall into OWL 2 EL. Hence, the computed subsumption relations
together with the remaining EL part can be handled by an OWL 2 EL reasoner to obtain
complete classification. Let S na be the set of non-EL axioms in an ontology, Algorithm</p>
      </sec>
      <sec id="sec-2-4">
        <title>1 describes the process of classifying OWL 2 ontologies in a modular manner, where</title>
      </sec>
      <sec id="sec-2-5">
        <title>AR (Assistant Reasoner) stands for an OWL 2 reasoner and MR (Main Reasoner) for an OWL 2 EL reasoner.</title>
        <p>4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiment and Evaluation</title>
      <sec id="sec-3-1">
        <title>The proposed approach is implemented in a prototype SGMR in which the OWL 2</title>
        <p>reasoner and OWL 2 EL reasoner are integrated in a black-box manner. We conduct an
experiment on eight commonly used ontologies available from the NCBO BioPortal
ontology repository 5. Table 1 provides statistics of test ontologies and Table 2 shows the
experimental results compared with MORe. In Table 2, MMORe (resp. MEL) represents
the non-EL subontology that is delegated to the OWL 2 reasoner in MORe (resp.
SGMR), and TMORe (resp. TS GMR) represents the time (in seconds) spent in classifying the
whole ontology by MORe (resp. SGMR). In our experiments, ELK 0.4.1 and HermiT
1.3.86 are used as OWL 2 EL reasoner and OWL 2 reasoner, respectively. The
experimental results show that SGMR delegates a smaller part of workload to the ine cient</p>
      </sec>
      <sec id="sec-3-2">
        <title>OWL 2 reasoner and obtain a substantial speedup compared with MORe.</title>
        <p>5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <sec id="sec-4-1">
        <title>In this paper, we present approach to classifying SROIQ ontologies by combining an</title>
      </sec>
      <sec id="sec-4-2">
        <title>OWL 2 EL with an OWL 2 reasoner. Compared with our previous work [1], we do</title>
      </sec>
      <sec id="sec-4-3">
        <title>5 http://bioportal.bioontology.org</title>
      </sec>
      <sec id="sec-4-4">
        <title>6 https://www.cs.ox.ac.uk/isg/tools/</title>
        <p>Ontology MMORe TMORe</p>
        <p>SYN 187 (1.2% ) 12.6
CSEO 8,693 (32.8% ) 20.3
Galen 35,976 (95.4% ) 25.4
Dermlex 18,347 (75.0% ) 17.2
Protein 3,972 (8.5% ) 12.6</p>
        <p>NCI 33,760 (15.4% ) 104.6
UBERON 14,906 (30.5% ) 76.4</p>
        <p>EFO 7,348 (29.2% ) 64.2</p>
        <p>MEL TS GMR
27 (0.8%) 5.1
94 (0.4% ) 4.7
2,165 (5.7% ) 3.5
8,219 (33.6% ) 3.7
288 (0.6% ) 1.7
7,151 (3.3% ) 17.2
12,988 (26.6% ) 31.4
897 (3.6% ) 21.3
not need to represent an ontology in the decomposed form. Compared with MORe, our
approach delegates a smaller workload to the less e cient OWL 2 reasoner hence o ers
a substantial speedup in ontology classification.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Acknowledgement. This work is supported by the program of the National Key Re</title>
        <p>search and Development Program of China (2016YFB1000603) and the National
Natural Science Foundation of China (NSFC) (61502336, 61373035). Xiaowang Zhang is
supported by Tianjin Thousand Young Talents Program.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          &amp;
          <string-name>
            <given-names>Z.</given-names>
            <surname>Feng</surname>
          </string-name>
          .
          <article-title>A Novel Combination of Reasoners for Ontology Classification</article-title>
          .
          <source>In: Proc. of ICTAI-13</source>
          , pp.
          <fpage>463</fpage>
          -
          <lpage>468</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Armas Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Cuenca</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <surname>&amp; I. Horrocks.</surname>
          </string-name>
          <article-title>MORe: Modular Combination of OWL Reasoners for Ontology Classification</article-title>
          .
          <source>In:Proc. of ISWC-12</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>C.</given-names>
            <surname>Del Vescovo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , U.Sattler, &amp; T. Schneider.
          <article-title>The Modular Structure of an Ontology: Atomic decomposition</article-title>
          .
          <source>In: Proc. of IJCAI-11</source>
          , pp.
          <fpage>2232</fpage>
          -
          <lpage>2237</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Pascal</given-names>
            <surname>Hitzler</surname>
          </string-name>
          , Markus Kr o¨
          <fpage>tzsch</fpage>
          , &amp;
          <article-title>Sebastian Rudolph. Foundations of Semantic Web Technologies</article-title>
          . Chapman and Hall/CRC Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>B.</given-names>
            <surname>Cuenca Grau</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          , &amp; U. Sattler.
          <article-title>Modular Reuse of Ontologies: Theory and Practice</article-title>
          .
          <source>Journal of Artificial Intelligence Research</source>
          ,
          <volume>31</volume>
          (
          <issue>1</issue>
          ):
          <fpage>273</fpage>
          -
          <lpage>318</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Patel-Schneider</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>The Description Logic Handbook: Theory, Implementation, and Applications</article-title>
          . Cambridge University Press, 2nd edn. (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>