<!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>Local safety of an ontology?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>s Homo</string-name>
          <email>lukashomola@hotmail.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>lius S</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>tuller</string-name>
          <email>stuller@cs.cas.cz</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Computer Science, Academy of Sciences of the</institution>
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <fpage>23</fpage>
      <lpage>30</lpage>
      <abstract>
        <p>The ability to import ontologies safely, that is, expertise/authority and cooperates with other teams without changing the original meaning of their terms, has to relate the part it is working on with other parts. been identi¯ed as crucial for the collaborative development Performing an upgrade of even only one such a comand the reuse of (OWL) ontologies. ponent ontology may require the participation of all In this paper, we propose the notion of local safety of an on- the teams as di®erent component ontologies are, when tology and we identify scenarios in which this notion may combined together, interrelated, depend on and a®ect tboe iumsepfourltinothgueridoinngtotlhoegiedsevsealfoeplym.ent of an ontology that is one another (changing one component ontology may thus necessitate changes to the others and might require teams to reconcile their changes). 1 Introduction By reusing an ontology we mean using it as an input to develop a new ontology. In such a process, signi¯cant parts of the reused ontology are often extracted, re¯ned, extended or otherwise adapted and then combined with other ontologies to form the ¯nal assembly. One of the prerequisites for e±cient collaborative ontology construction and maintenance is the ability to combine ontologies in a controlled way. The interaction among component ontologies should be controlled and well-understood in order to reduce the communication that is needed among di®erent teams and to avoid expensive reconciliation processes. Ideally, controlled interaction should allow di®erent teams to develop, test and upgrade their ontologies independently, to replace a component ontology or extend an ontology with minimal side e®ects. The issue is also vital for ontology reuse, especially in the case when the reused ontology, rather than being adapted and used as a draft to develop an ontology component, is linked to and remains under the control of its original developers, who may perform changes to it autonomously.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>? The work was supported by the project No. 1M0554
\Advanced Remedial Processes and Technologies" of the
Ministry of Education, Youth and Sports of the Czech
Republic and partly by the Institutional Research Plan
AV0Z10300504 \Computer Science for the Information
Society: Models, Algorithms, Applications". The ¯rst
author also acknowledges the ¯nancial support of the
Department of Mathematics at his institution.</p>
    </sec>
    <sec id="sec-2">
      <title>3 http://www.w3.org/2002/07/owl#imports, to be pre</title>
      <p>cise
contained in some other OWL ontology. In the import- built using concept and role constructors. We assume
ing ontology, there is no logical di®erence between the the sets C, R and I of (respectively) atomic concepts,
statements that are imported and the proper ones. atomic roles and individuals to be countably in¯nite</p>
      <p>A number of recent papers by Grau et al. [3{7] and mutually disjoint and to be ¯xed for every DL.
stressed the particular relevance of the ability to im- An ontology O formalized in a DL takes the form of
port OWL ontologies \safely", that is, in such a way a ¯nite set of terminological and role axioms, which
that the imported terms (the terms of the imported are used to suitably organize and interrelate multiple
ontologies) preserve their original meaning (the mean- concept and role descriptions. DLs are distinguished
ing these terms have in the imported ontologies) in the by constructors and/or types of axioms they provide.
importing ontology. This ability is applicable in typi- We will use the term L-axiom (L-ontology) to
emphacal scenarios of OWL ontology development such as in size we are talking about an axiom (an ontology) in
the following one (see the above-mentioned works by the DL L.</p>
      <p>Grau et al. for a motivating example): In the abstract notation we will use the letters A, B
to denote atomic concepts, r, s to denote atomic roles,
and a, b for individuals (all the letters possibly with
a subscript). The letters C, D will be used to denote
a concept (atomic or complex), R, S to denote a role,
and ®, ¯ to denote an axiom.</p>
      <p>As the minimal DLs of practical interest are
usually considered the DLs E L and AL, which both are
fragments of the smallest propositionally closed DL
ALC. In ALC, concepts are composed inductively
according to the following syntax rule:
{ an ontology engineer distinguishes between the
socalled external terms and the so-called local terms
of the ontology O he or she is developing;
{ the local terms are those whose meaning is
assumed to be fully described in the ontology O
itself, possibly with the help of the remaining,
external terms;
{ the meaning of the external terms is assumed to
be only partially described in the ontology O { in
terms of their use in the description of the local
terms { and to be further described in some other
ontologies (preexistent or concurrently developed)
that are to be imported into O;
{ the use of the external terms in the statements of
the ontology O is expected not to alter the original
meaning these terms have in the ontologies to be
imported.</p>
      <sec id="sec-2-1">
        <title>C u D (conjunction) j C t D (disjunction) j</title>
        <p>? (bottom concept) j &gt; (top concept) j</p>
      </sec>
      <sec id="sec-2-2">
        <title>C; D ! A (atomic concept) j</title>
        <p>In the paper, we continue in the study, initiated
by Grau at al., of the methodology for OWL ontology
development in the scenario given above. We propose
the notion of local safety of an ontology and discuss
under which conditions and how this notion can be
used to guide the development of OWL ontologies.
3</p>
        <sec id="sec-2-2-1">
          <title>Preliminaries</title>
          <p>
            In this section we introduce description logics (DLs) [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ],
a family of logic-based knowledge representation
formalisms, which underly modern ontology languages A terminological axiom in E L, AL and ALC is an
such as OWL. OWL consists of three (sub)languages expression of the following forms: A ´ C (concept
deof increasing expressive power, two of which, namely ¯nition), A v C (concept specialization) or C v D
OWL Lite and OWL DL, roughly correspond to the (general concept inclusion, GCI). The abbreviation of
DLs SHIF and SHOIN , respectively. the form C ´ D (concepts equality ) stands for the two
          </p>
          <p>DLs view the world as being populated by ob- GCIs C v D and D v C. E L, AL and ALC provide
jects and allow one to represent the relevant notions of no role axioms.
the domain of interest in terms of concepts, roles and S is an extension of ALC in which an atomic role
(possibly) individuals, representing sets of elements, can be declared transitive using the role axiom of the
binary relationships between elements and single el- form Trans(r).
ements, respectively. Starting from atomic concepts, Further extensions of DLs are indicated by
apatomic roles and individuals, which are denoted sim- pending letters to the DL's name. Advanced concept
ply by a name, complex concepts and complex roles are constructors include number restrictions of the form
:C (concept negation) j</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>9R:C (existential restriction) j</title>
      </sec>
      <sec id="sec-2-4">
        <title>8R:C (value restriction):</title>
      </sec>
      <sec id="sec-2-5">
        <title>Valid constructs for E L are: ?, C u D and 9R:C.</title>
        <p>In AL, the syntax of complex concepts is the
following: ?, &gt;, :A (atomic concept negation), C uD, 9R:&gt;
(limited existential restriction), and 8R:C.</p>
        <p>DLs E L, AL and ALC provide no role constructors.</p>
        <p>The listed ALC constructors are not all
independent (&gt; = :?, C t D = :(:C u :D), 8R:C =
:(9R::C)). In fact, ALC can be obtained from both
E L and AL by adding the concept negation
constructor.
¸ nR (indicated by appending the letter N ), quali- O j= C v D, and satis¯ability of concept C in the
¯ed number restrictions ¸ nR:C (appending Q) and case O 6j= C v ?.
bnoermriensatlrsictfiaogns(aanpdpeqnudailni¯gedOn).u mInbetrheresctarsicetioofnsn,utmhe- Interpretations I and J are isomorphic (written
dual constructors · nR and · nR:C are introduced I »= J ) i® there is a bijection ¹ : ¢I ! ¢J such
rraeesspaprbeebscetrnievtveiinlaygt.ioNanossmifnoigrnla:elt(so¸nalnlsoe+wts1cRtoon)tacaoninndsin:trg(u¸cotnnea+icn1odRnic:vCeipd)t-, if(tnoh¹lta(leoxtrw)pf;iro¹nerg(tyaeh)tv)ioeolr2ndyssr:xaJx;r,ey2xs2eA=mI¢aanIiI®t;iAic¹®a(lx2l¹y)(xC2in);dAr=isJ2ta,inJ(Rgx.u;;Iiyasso)hm2a2bolIrrepIth(hiii®nce
ual. Enumeration fa1; : : : ; ang is an abbreviation for particular, they satisfy the same axioms).
fa1g t : : : t fang.</p>
        <p>Yet other extensions include role constructors, of A signature S is a ¯nite subset of C[R[I. Two
inwhich the inverse role constructor r¡ (appending I) terpretations I and J coincide on a signature S
(writis the most prominent one. Another important type of ten IjS = J jS) i® ¢I = ¢J and XI = XJ holds for
role axioms is the role inclusion R v S (appending H). all X 2 S.</p>
        <p>These extensions can be used in di®erent combina- We say that I has been obtained from J through
tions, for example ALN is an extension of AL with a domain expansion with the set ¢ (such I will by
number restrictions, and SHOIN is the DL that uses denoted by J[¢) i® ¢ is a non-empty set disjoint
5 of the constructors we have presented. with ¢J , ¢I = ¢J [ ¢, and XI = XJ holds for all</p>
        <p>The semantics of DLs is de¯ned via interpretations. X 2 C [ R [ I. Note that J[¢ and J only di®er in
An interpretation I is a pair I = (¢I ; :I ), where ¢I that the domain of J is a proper subset of the domain
is a non-empty set, called the domain of the inter- of J[¢ (with ¢ being the set of additional domain
pretation, and :I is the interpretation function, which elements).
maps atomic concepts to subsets of ¢I , atomic roles to
binary relations over ¢I and individuals to elements A DL L is said to have the ¯nite model property
of ¢I . The interpretation function extends to complex (FMP) i® every consistent L-ontology admits a model
concepts as follows: that is ¯nite (i.e., with a ¯nite domain). One of the
most prominent DLs that exhibit the FMP is SHOQ,
?I = ;; &gt;I = ¢I ; while SHIN is an example of a DL that lacks the
(C u D)I = CI \ DI ; (C t D)I = CI [ DI ; FMP. For a DL L with the FMP, L-ontology O and</p>
        <p>L-axiom ® the following holds: O j= ® i® I j= ® for
(:C)I = ¢I ¡ CI ; all ¯nite models I j= O.
(8R:C)I = fx 2 ¢I ; 8y ((x; y) 2 RI ! y 2 CI )g;
We say that an interpretation K is a disjoint union
(9R:C)I = fx 2 ¢I ; 9y ((x; y) 2 RI ^ y 2 CI )g; of interpretations I and J (written K = I ] J ) i®
(¸ nR)I = fx 2 ¢I ; jfy 2 ¢I ; (x; y) 2 RI gj ¸ ng; there exist some interpretations I~ and J~ satisfying
(¸ nR:C)I = fx 2 ¢I ; I~ »= I, J~ =» J and ¢I~ \ ¢J~ = ; for which the
foljfy 2 ¢I ; (x; y) 2 RI ^ y 2 CI gj ¸ ng; lowing holds: ¢K = ¢I [ ¢J~, XK = XI [ XJ~ for all
~ ~
a I = faI g; X 2 C [ R and aK = aI~ for all a 2 I. Intuitively, the
(rf¡g)I = f(x; y); (y; x) 2 rI g: ipnotseerdpreotfattwioon uKnrfeolratwedhicpharKts
=onIe]bJeinhgolidsosmisorcpohmicto I and the other to J . Disjoint union of a set of
interpretations is de¯ned analogously.</p>
        <p>The semantics of terminological axioms is de¯ned in
terms of a satisfaction relation j=, which relates
interpretations to the terminological axioms they satisfy. A DL L is said to have the disjoint union model
It is de¯ned as follows: I j= C v D i® CI µ DI , property (DUMP) i® the set of models of arbitrary
I j= R v S i® RI µ SI , I j= C(a) i® aI 2 CI , L-ontology is closed under disjoint unions.
rIelja=tioRn(ar;Ib)is i®tra(nasIi;tibvIe). I2ntRerIp,reItajt=ionTsrasnast(irsf)yiin®gtahne A prominent example of a DL that enjoys the
axiom are said to be its models. DUMP is SHIQ. DLs that support nominals do not</p>
        <p>An interpretation I is a model of an ontology O have this property.
(written I j= O) i® I j= ® for all ® 2 O. An ontology In the subsequent sections, will use C(®) to denote
is said to be consistent if it has at least one model and the set of all atomic concepts that occur in the axiom ®
is said to be inconsistent otherwise. (the sets R(®) and I(®) are de¯ned analogously). We</p>
        <p>
          An ontology O entails an axiom ® (written O j= ®) will use Sig(®) as a shorthand for C(®) [ R(®) [ I(®).
i® all models of O satisfy ®, especially we will speak C(O) will stand for S®2O C(®) (the sets R(O), I(O)
about subsumption between C and D in the case of and Sig(O) are de¯ned analogously).
4 Related work As Grau et al. showed, even the problem of
checking whether an ontology consisting of a single ALC
axIn the papers by Grau et al. [3{7], safety of ontology iom is safe for a signature w.r.t. ALCO is undecidable.
import is formulated using the notion of conservative It is not yet known whether the safety for a signature
extension, in the context of ontologies ¯rst used in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] is decidable for weaker DLs, such as E L, or for more
and recently further studied in [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ]. expressive DLs. Grau et al. proposed several safety
classes of ontologies, parametrized by a signature S
De¯nition 1 (Conservative extension). Let L be and representing su±cient conditions for safety for S,
a DL, O1 and O2 two ontologies such that O1 µ O2. that are decidable and can be checked syntactically in
        </p>
        <p>
          We say that O2 is a deductive conservative ex- polynomial time.
tension of O1 w.r.t. L, if for every L-axiom ® with Several extensions to OWL have been proposed
Sig(®) µ Sig(O1), we have O2 j= ® i® O1 j= ®. to better support collaborative ontology
developAn ontology O into which an ontology O0 can be safely ment and ontology reuse, including P-OWL [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ],
imported is said to be safe for O0. C-OWL [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], the extension based on E
-connections [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] and the extension based on the so-called
De¯nition 2 (Safety for an ontology). Let L be semantic import [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. All such extension are, however,
a DL, O and O0 two ontologies. still subjects of research and are not included in the
        </p>
        <p>
          We say that O is safe for O0 w.r.t. L, if O [ O0 is current candidate recommendation for OWL 2 [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], an
a conservative extension of O0 w.r.t. L. ongoing extension to and revision of OWL.
5
        </p>
        <sec id="sec-2-5-1">
          <title>Local safety of an ontology</title>
          <p>
            Ghilardi at al. [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] studied novel DL reasoning services
aimed at supporting developers in customizing their
ontology to be safe for a particular ontology.
          </p>
          <p>As regards the scenario we are concerned with,
Grau et al. [3{7] argues that in practice it is often
convenient, or even necessary, for the developers of an
ontology O to abstract from particular ontologies that
are to be imported into it and focus instead only on O
and on its external terms:
Grau et al. proposed the following condition to be used
to guide the development of an ontology O in such
cases.</p>
          <p>The notion of safety for a signature, along with the
corresponding safety classes, facilitates the
construction of an ontology that is safe for any ontology (in
a given DL) with which it shares only some
prearranged set of terms.</p>
          <p>In the scenario we are interested in here, however,
{ ontologies to be imported might not be available an ontology engineer does not always need to have
during the development of O (as it is in the case the ontology O safe for every possible ontology (every
when these ontologies are developed concurrently possible set of axioms in a certain DL), but often only
with O); needs to have it safe for a certain, conveniently
cho{ the developers of O are usually not willing to com- sen class of candidate ontologies. This is the case, for
mit to particular versions of the ontologies they instance, when the scenario applies to collaborative
intend to import (the development of a typical on- ontology development and O is considered as a
compotology is a never-¯nished process); nent ontology for a larger ontology developed
distribu{ at a later time, the developers might ¯nd ontolo- tively as a set of ontologies importing one another. The
gies other than those initially considered more development of component ontologies in such a case is
suitable for providing the meaning of the external typically coordinated to some extent (e.g., some
printerms of O. ciples on which individual component ontologies will
be build are resolved beforehand and made explicit)
and the developers can make assumptions about some
qualities and characteristics of the ontologies they
import (as well as about the way these ontologies may
further evolve).</p>
          <p>De¯nition 3 (Safety for a signature). Let L be
a DL, O an ontology and S a signature.</p>
          <p>We say that O is safe for S w.r.t. L, if for every
L-ontology O0 such that Sig(O) \ Sig(O0) µ S, O is
safe for O0 w.r.t. L.</p>
        </sec>
      </sec>
      <sec id="sec-2-6">
        <title>Once an ontology O is safe for the signature S (which is presumably the set of its external terms) w.r.t. L, one can safely import into O any ontology O0 written in L and sharing only terms from S with O.</title>
        <p>5.1</p>
        <p>
          Local ontologies
Ontologies, like other engineering artifacts, are
designed. When we choose how to represent something
in an ontology4, we are making design decisions. The
4 \There is no one correct way to model a domain { there
are always viable alternatives." [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]
best solution to ontology design depends on a num- Intuitively, an ontology restricts the meaning of the
ber of factors, of which the most important include top concept if it introduces its vocabulary in such
the intended use of an ontology, and the anticipated a way that the vocabulary can only be further
speextensions and re¯nements to it. cialized but not otherwise monotonically extended. In
        </p>
        <p>Generally accepted and widely cited are the ¯ve de- the case of domain, task and application ontologies
sign criteria Gruber [19] proposed for ontologies whose at least, such an ontology can be considered
badlypurpose is knowledge sharing and interoperation designed:
among programs. They include the following criterion:
Proposition 1. A SHOIQ ontology restricts the
meaning of the top concept i® it is not local.</p>
        <p>Grau et al. [25] also reported testing over 700
ontologies available on the Web for localness and ¯nding
more than 99% of them local. However, we could not
trace any further details on their experimental results.
5.2</p>
        <p>Local safety
Regarding the development of an ontology in our
scenario, the considerations above suggest that it is often
possible to consider only local ontologies as the
candidates for importing.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5 http://www.ifomis.org/bfo</title>
      <p>6 http://www.jfsowa.com/ontology/toplevel.htm
7 Relevant points of the characterization are reproduced</p>
      <p>at the beginning of the Appendix.</p>
      <p>An ontology should o®er a conceptual
foundation for a range of anticipated tasks, and the
representation should be crafted so that one
can extend and specialize the ontology
monotonically. Especially, one should be able
to de¯ne new terms for special uses based on
the existing vocabulary, in a way that does not
require the revision of the existing de¯nitions.</p>
      <p>An ontology should be extensible. [. . . ]
Extension should be possible both at a low level, by
adding domain-speci¯c subconcepts, or at high
level by adding intermediate or upper level
concepts that cover new areas.</p>
      <p>As regards top-level ontologies, we studied the Basic
Formal Ontology5 and also the design of several other
To facilitate the design, deployment and reuse of on- top-level ontologies [22], and came to the conclusion
tologies, Guarino [20] suggested the development of that even in this case the developers prefer not to
redi®erent kinds of ontologies with di®erent levels of gen- strict the meaning of the top concept. The only
exceperality and dependence on a particular domain, task tion we found is the top-level ontology6 proposed by
or point of view, namely top-level ontologies, domain John Sowa.
and task ontologies and application ontologies. Terms The notion of restricting the meaning of the top
of ontologies on a lower level are, in some sense, held concept is closely related to the notion of localness of
to be specializations of terms of ontologies on a level an ontology studied (also under the name safety of an
above. Top-level ontologies, which describe concepts ontology) by Grau et al. [23{26].
independent of a particular problem or domain (such De¯nition 5 (Localness). An ontology O is local if
as space, time, object, event, action, etc.) are meant the set of its models is closed under domain expansion
to be unifying for a large group of ontologies on lower (i.e., if I j= O implies I[¢ j= O for every
interpretalevels. tion I and every non-empty set ¢ disjoint with ¢I ).</p>
      <p>Swartout et al. [21] proposed a number of
desiderata aimed primarily at domain, task and application In [23], a syntactic characterization of localness for
ontologies. They include the two following: SHOIQ ontologies is given, which allows one to check
localness of an SHOIQ ontology in polynomial time.</p>
      <p>We used this characterization7 to show that SHOIQ
ontologies restricting the meaning of the top concept
are exactly those that are not local.</p>
      <p>Ontologies should not be \stovepipes." The
derisive term \stovepipe system" is used to
describe a system that may be vertically
integrated but cannot be integrated horizontally
with other systems.</p>
      <p>Here we propose a notion of restricting the
meaning of the top concept, which, as we believe, provide
a partial characterization of ontologies violating the
aforementioned criteria.</p>
      <p>De¯nition 4 (Restricting the meaning of the
top concept). We say that the ontology O restricts
the meaning of the top concept, if there are atomic
concepts A1; : : : ; An, atomic roles r1; : : : ; rm; s1; : : : ; sk
and individuals a1; : : : ; al in Sig(O) such that:</p>
      <p>O j= &gt; v A1 t : : : t An t 9r1:&gt; t : : : t 9rm:&gt; t
t 9s1¡:&gt; t : : : t 9sk¡:&gt; t fa1; : : : ; alg:
{ it can not be, without previous modi¯cation,
extended to cover a broader subject area than it
already does,
{ it is unsuitable for importing into any ontology
that touches, even marginally, a subject area
disjoint with that already covered by it.
De¯nition 6 (Local safety for a signature). Let Proposition 5. Let S be a signature such that S µ C,
L be a DL, S a signature and O an ontology. O a SHIQ ontology and a an individual. Assume that</p>
      <p>We say that O is locally safe for S w.r.t. L, if for there exists a subset S~ µ S such that the ontology
every local L-ontology O0 with Sig(O) \ Sig(O0) µ S,
O is safe for O0 w.r.t. L. O [ fA ´ faggA2S~ [ fA ´ ?gA2S¡S~
The following proposition provides su±cient condition
for local safety w.r.t. SHOIQ.</p>
      <p>Proposition 2. Let S be a signature and O an
ontology such that for every interpretation J there exists
a model I of O such that
{ ¢I = ¢J [ ¢ for some ¢, ¢ \ ¢J = ;,
{ XI = XJ for all X 2 S.</p>
      <p>Then O is locally safe for S w.r.t. SHOIQ.</p>
      <p>The following example demonstrates that, in
comparison with safety condition proposed by Grau et al.,
the condition of local safety is less restrictive and may
allow for a more convenient use of the external terms.</p>
      <p>Example 1. Let us consider building an OWL
ontology intended to provide a reference terminology for the
annotation of ¯lms. Let us assume we intend to safely
import into our ontology O some well-designed (and
thus local) ontology that de¯nes the categorization of
¯lms by genre. Suppose that the atomic concept Film
is expected to be the only term our ontology will share
with the imported ontology. Whereas the ontology
is inconsistent.</p>
      <p>Then O is not locally safe for S w.r.t. ALO (E LO).</p>
      <p>Corollary 1. Let S be a signature such that S µ C,
O a SHIQ ontology.</p>
      <p>Then O is locally safe for S w.r.t. SHOQ i® O is
locally safe for S w.r.t. ALO (E LO).</p>
      <p>Corollary 2. Let L be a DL that is in between ALO
(E LO) and SHOQ.</p>
      <p>The problem of deciding whether a SHIQ
ontology is locally safe for a signature S, S µ C, w.r.t. L
is reducible to the problem of checking consistency of
a ¯nite set of SHOIQ ontologies, and thus decidable.</p>
      <p>Corollary 3. Let O be a SHIQ ontology locally safe
for S µ C w.r.t. SHOQ, O0 a local SHOQ ontology
such that Sig(O)\Sig(O0) µ S. Then O [O0 is locally
safe for S n Sig(O0) w.r.t. SHOQ.
6</p>
      <sec id="sec-3-1">
        <title>Conclusion and outlook</title>
        <p>{ ¢I = ¢J [ ¢ for some ¢, ¢ \ ¢J = ;,
{ XI = XJ for all X 2 S.</p>
        <p>O = fDirector v :Film; Film v 9hasDirector:Directorg This paper contributes to the framework for ontology
development presented by Grau et al. We proposed
is not safe for fFilmg even w.r.t. AL (take the non- the notion of local safety of an ontology and showed
local ontology O0 = f&gt; v Filmg as a counterexample), its applicability in the development of real-world
onit is, according to Proposition 2, locally safe for fFilmg tologies. We showed that local safety for a signature
w.r.t. SHOIQ. consisting solely of atomic concepts is decidable for an
When we are concerned with local safety w.r.t. SHOQ interesting group of description logics.
(which has the FMP) we can use the following su±- For the future work, we would like to study
decient condition. cidability and computational properties of (su±cient
Proposition 3. Let S be a signature and O an on- conditions for) local safety for a signature that
contology such that for every ¯nite interpretation J there tains atomic roles as well. The results obtained in the
exists a model I of O such that paper are also directly applicable to the problem of
extracting reusable ontology parts, or ontology modules,
as conceived by Grau et al. in the cited works.</p>
        <p>Then O is locally safe for S w.r.t. SHOQ.</p>
        <p>The two following propositions give a recipe for
deciding local safety of an ontology written in SHIQ
(which has the DUMP) w.r.t. SHOQ in the case when
all external terms are atomic concepts.</p>
        <p>Proposition 4. Let S be a signature such that S µ C,
O a SHIQ ontology and a an individual. Assume that
for every subset S~ µ S the ontology</p>
        <p>O [ fA ´ faggA2S~ [ fA ´ ?gA2S¡S~
is consistent.</p>
        <p>Then O is locally safe for S w.r.t. SHOQ.
we have CI[¢ = CI and DI[¢ = DI [ ¢. By (?) and
by the fact that ¢ \ CI = ; (because ¢ \ ¢I = ;),
we get CI[¢ 6µ DI[¢ . For C non-local, D local, we
have CI[¢ = CI [ ¢ and DI[¢ = DI . By (?), we
get CI[¢ 6µ DI[¢ . For C, D are non-local, we have
CI[¢ = CI [ ¢ and DI[¢ = DI [ ¢. By (?) and
by the fact that ¢ \ CI = ;, ¢ \ DI = ; (because
¢ \ ¢I = ;), we get CI[¢ 6µ DI[¢ . For each of the and Sig(®) µ Sig(O0), K 6j= ®.
four possible cases we showed that I[¢ 6j= C v D.</p>
        <sec id="sec-3-1-1">
          <title>We showed there exists a model of O [ O0 that is</title>
          <p>The remaining types of SHOIQ axioms (C ´ D, not a model of ®, which yields a contradiction with</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Trans(r), R v S) can be treated in the same way.</title>
          <p>the assumption (¤).</p>
          <p>Proof (of Proposition 1.). The proposition is obviously
true for inconsistent ontologies.</p>
        </sec>
        <sec id="sec-3-1-3">
          <title>Assume that a consistent ontology O restricts the</title>
          <p>meaning of the top concept. Then, by De¯nition 4,
O j= &gt; v C for some C of the form A1 t : : : t An t
9r1:&gt;t: : :t9rm:&gt;t 9s1¡:&gt;t: : :t9 k
s¡:&gt;tfa1; : : : ; alg.</p>
          <p>Take any model I of O and any x 2= ¢I . As &gt;I[fxg =
¢I [ fxg and CI[fxg = ¢I , I[fxg 6j= &gt; v C, and thus</p>
        </sec>
        <sec id="sec-3-1-4">
          <title>I is not a model of O . This shows O is not local.</title>
        </sec>
        <sec id="sec-3-1-5">
          <title>Assume a consistent SHOIQ ontology O does not model J of O0 such that J 6j= ®.</title>
          <p>Proof (of Proposition 3.). Same proof as of
Proposition 2 goes through - we only need to replace the
sentence labeled with (¦) with the following: Because (?)
and because SHOQ has the FMP, there exists a ¯nite</p>
          <p>Proof (of Proposition 4.). Let J be a ¯nite
interpre</p>
        </sec>
        <sec id="sec-3-1-6">
          <title>Let us associate with every x 2 ¢J (¢J is ¯nite)</title>
          <p>an unique ax 2 I, ax 2= Sig(O) (i.e., di®erent elements
are associated with di®erent individuals). For every
where</p>
          <p>A1; : : : ; An,
r1; : : : ; rm
and
a1; : : : ; al
are
model I
all atomic
concepts, atomic roles
and
individuals
a model I of O such that I 6j= &gt; v C. Pick any such
in Sig(O). Since O 6j
=</p>
          <p>&gt; v C, there exists
. Since I 6j</p>
          <p>= &gt; v C, there exists an object
¢I such that x do not participate in the
interpretation XI of any atomic concept, atomic role
and individual X in Sig(O). Observe that: for all
local SHOIQ concepts C1 composed of the symbols
from Sig(O), x 2= C1I holds; for all non-local SHOIQ
concepts C2 composed of the symbols from Sig(O),
x 2 C2I holds. Therefore, O does not contain a GCI
of O</p>
          <p>0 w.r.t. SHOIQ.</p>
        </sec>
        <sec id="sec-3-1-7">
          <title>SHOIQ ontology with Sig(O) \ Sig(O0) µ S. We need to show that O [ O0 is a conservative extension</title>
          <p>Assume (for</p>
          <p>contradiction) that there exists
a SHOIQ axiom ® with Sig(®) µ Sig(O0) for which
both O 6j
0 = ® (?) and O [ O j
0 = ® ( ) hold.</p>
          <p>¤
By (?), there is a model J of O0 such that J 6j= ®. (¦)</p>
          <p>The conditions of the proposition imply the
existence of a model I of O such that ¢I = ¢J [ ¢, ¢ \
pretation K satisfying: ¢K = ¢I , XK = XI for all X 2
Sig(O), XK = XJ for all X 2 Sig(O0). Such an
interpretation exists as XI = XJ for X 2 Sig(O)\Sig(O0),
and thus is local.
of the form C2 v C1 (otherwise I were not its model) following holds: AIx = faxIx g if x 2 AJ ; AIx = ; if
Proof (of Proposition 2.). Let O0 be an arbitrary local and thus AI = AJ (¦).
and, consequently, AI = S
x 2= AJ . Thus, for A 2 S we have AI~ = S
x2AJ faxI g = S
x2AJ faxI~g
x2AJ fxg,
(?), we get CI[¢ 6µ DI[¢ . For C local, D non-local, and symbols not occurring in Sig(O) \ Sig(O0) can be
¢J = ; and XI = XJ for all X 2 S. Pick any inter- inconsistent (O [ O</p>
          <p>O [ fA ´ faxggA2Sx [ fA ´ ?gA2S¡Sx :
Pick some interpretation I~ such that I~ = U
axI = x for all x 2 ¢J (to get such interpretation I it
is enough to \rename" ¯nitely many elements in ¢I~).
tology, SHIQ has the DUMP, ¢J is ¯nite, we have</p>
          <p>, I j= O (?).</p>
          <p>As axI = x for all x 2 ¢J , we have ¢J µ ¢I (¤).</p>
        </sec>
        <sec id="sec-3-1-8">
          <title>It is easy to see that for A 2 S and x 2 ¢J the</title>
          <p>interpreted arbitrarily.</p>
          <p>Since
J[¢jSig(O0), K j= O0. Therefore K j= O [ O0.
we have J[¢ j= O0 and consequently, since KjSig(O0) =</p>
          <p>= ®, we have, using Lemma 1, that
J[¢ 6j= ®. Furthermore, since KjSig(O0) = J[¢jSig(O0)
inition 4, O 6j= &gt; v C for C of the form A1 t : : : t An t
restrict the meaning of the top concept. Then, by Def- x 2 ¢J , let us set Sx = fA 2 S; x 2 AJ g.
The conditions of the proposition imply that for
9r1:&gt;t: : :t9rm:&gt;t 9r1¡:&gt;t: : :t9rm¡:&gt;tfa1; : : : ; alg, every x 2 ¢J there exists a model Ix of
w.r.t. SHOQ</p>
          <p>.</p>
        </sec>
        <sec id="sec-3-1-9">
          <title>We showed that, for any ¯nite interpretation J , there exists an interpretation I satisfying (?; ¤; ¦). Using Proposition 3 we have that O is locally safe for S</title>
          <p>Proof (of Proposition 5.). Consider an ALO (E LO)
ontology O
0 = fA
´</p>
          <p>faggA2S~ [ fA ´ ?gA2S¡S~ ,
which evidently is local, satis¯es Sig(O) \ Sig(O0) µ
S and is consistent (O0 6j= &gt; v ?). The conditions
of the proposition say that the ontology O [ O</p>
        </sec>
        <sec id="sec-3-1-10">
          <title>Sig(O) \ Sig(O0) µ S for which O is not safe.</title>
          <p>there exists a local ALO (E LO) ontology O0 satisfying</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>T.R.</given-names>
            <surname>Gruber</surname>
          </string-name>
          :
          <article-title>A translation approach to portable ontology speci¯cations</article-title>
          .
          <source>Knowledge Acquisition</source>
          ,
          <volume>5</volume>
          ,
          <issue>2</issue>
          ,
          <year>1993</year>
          ,
          <volume>199</volume>
          {
          <fpage>220</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>P.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hayes</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I.</surname>
          </string-name>
          <article-title>Horrocks: OWL Web Ontology Language: Semantics and Abstract Syntax</article-title>
          .
          <source>W3C recommendation, W3C</source>
          ,
          <year>2004</year>
          . Available at http://www.w3.org/TR/owl-semantics/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          , and U. Sattler: Ontology Reuse:
          <article-title>Better Safe than Sorry</article-title>
          . In Description Logics, Bozen/Bolzano University Press,
          <year>2007</year>
          ,
          <volume>41</volume>
          {
          <fpage>52</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          , and U. Sattler:
          <article-title>Technical report, Stanford Knowledge Systems LaboJust the right amount: extracting modules from ontolo- ratory</article-title>
          ,
          <year>2001</year>
          . Available at http://protege.stanford. gies.
          <source>In Proc. of the 16th Int. World Wide Web Conf</source>
          ., edu/publications/ontology development/
          <year>2007</year>
          ,
          <volume>717</volume>
          {
          <fpage>727</fpage>
          . ontology101
          <article-title>-noy-mcguinness</article-title>
          .
          <source>html.</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          , and U. Sattler: 19.
          <string-name>
            <surname>T.R. Gruber</surname>
          </string-name>
          :
          <article-title>Toward principles for the design of onA logical framework for modularity of ontologies. In tologies used for knowledge sharing</article-title>
          .
          <source>Int. Journal of Proc. of the 20th Int. Joint Conf. on Arti¯cial Intelli- Human-Computer Studies</source>
          ,
          <volume>43</volume>
          ,
          <fpage>5</fpage>
          -
          <lpage>6</lpage>
          ,
          <year>1995</year>
          ,
          <volume>907</volume>
          {
          <fpage>928</fpage>
          . gence,
          <year>2007</year>
          . 20. N. Guarino:
          <article-title>Formal ontology and information systems</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , I. Horrocks,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          , and U. Sattler: In N. Guarino, editor,
          <source>Proc. of the 1st Int. Conf. on Modular reuse of ontologies: theory and practice. Jour- Formal Ontologies in Information Systems</source>
          , IOS Press,
          <source>nal of Arti¯cial Intelligence Research</source>
          ,
          <volume>31</volume>
          ,
          <year>2008</year>
          ,
          <volume>273</volume>
          {
          <year>1998</year>
          ,
          <volume>3</volume>
          {
          <fpage>15</fpage>
          .
          <fpage>318</fpage>
          . 21. B.
          <string-name>
            <surname>Swartout</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Patil</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Knight</surname>
          </string-name>
          , and T. Russ: Toward
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>E.</given-names>
            <surname>Jimenez-Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Schneider</surname>
          </string-name>
          , U. Sattler,
          <article-title>distributed use of large-scale ontologies</article-title>
          .
          <source>In Proc. of and R</source>
          . Berlanga:
          <article-title>Safe and economic re-use of on- the 10th Knowledge Acquisition for Knowledge-Based tologies: a logic-based methodology and tool support</article-title>
          .
          <source>Systems Workshop</source>
          ,
          <year>1996</year>
          .
          <source>In Proc. of the 5th European Semantic Web Conf., 22</source>
          .
          <string-name>
            <given-names>N.F.</given-names>
            <surname>Noy</surname>
          </string-name>
          and
          <string-name>
            <surname>C.D.</surname>
          </string-name>
          <article-title>Hafner: The state of the art in</article-title>
          <source>Springer LNCS</source>
          ,
          <year>2008</year>
          .
          <article-title>ontology design: A survey and comparative review</article-title>
          .
          <source>AI</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <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.L.</given-names>
            <surname>McGuinness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nardi</surname>
          </string-name>
          , Magazine,
          <volume>18</volume>
          ,
          <year>1997</year>
          ,
          <volume>53</volume>
          {
          <fpage>74</fpage>
          . and
          <string-name>
            <given-names>P.F.</given-names>
            <surname>Patel-</surname>
          </string-name>
          Schneider, editors:
          <source>The Description 23. B</source>
          .
          <string-name>
            <surname>C. Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Parsia</surname>
          </string-name>
          , E. Sirin,
          <article-title>and</article-title>
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Kalyanpur: Logic Handbook: Theory, Implementation, and Appli- Modularity and web ontologies</article-title>
          . In P. Doherty,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mycations</surname>
          </string-name>
          . Cambridge University Press,
          <year>2003</year>
          . lopoulos, and
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>A</article-title>
          . Welty, editors,
          <source>Proc. the 20th Int.</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>G.</given-names>
            <surname>Antoniou</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Kehagas</surname>
          </string-name>
          :
          <article-title>A note on the the re¯ne- Conf. on Principles of Knowledge Representation and ment of ontologies</article-title>
          .
          <source>Int. Journal of Intelligent Systems, Reasoning</source>
          , AAAI Press,
          <year>2006</year>
          ,
          <volume>198</volume>
          {
          <fpage>209</fpage>
          . 15,
          <issue>7</issue>
          ,
          <year>2000</year>
          ,
          <volume>623</volume>
          {
          <fpage>632</fpage>
          . 24.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , E. Sirin,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Kalyanpur:
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          <article-title>: Conservative extensions in Automatic partitioning of OWL ontologies using Ethe lightweight description logic EL</article-title>
          .
          <source>In Proc. of the connections. In Proc. of the 18th Int. Workshop on 21th Conf. on Automated Deduction</source>
          , Springer-Verlag,
          <source>Description Logics</source>
          ,
          <year>2005</year>
          .
          <year>2007</year>
          , volume
          <volume>4603</volume>
          ,
          <volume>84</volume>
          {
          <fpage>99</fpage>
          . 25.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          , and U. Sattler: Will
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>C. Lutz</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Walther</surname>
            , and
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Wolter</surname>
          </string-name>
          <article-title>: Conservative ex- my ontologies ¯t together?</article-title>
          <source>In Proc. of the 19th Int</source>
          .
          <article-title>tensions in expressive description logics</article-title>
          . In M. Veloso, Workshop on Description Logics,
          <year>2006</year>
          . editor,
          <source>Proc. of the 20th Int. Joint Conf. on Arti¯cial 26. B.C. Grau and O. Kutz: Modular ontology languages Intelligence</source>
          , AAAI Press,
          <year>2007</year>
          ,
          <volume>453</volume>
          {
          <fpage>458</fpage>
          . revisited. In Workshop on Semantic Web for Collab-
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghilardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          <article-title>: Did I damage orative Knowledge Acquisition at the 20th Int</article-title>
          .
          <article-title>Joint my ontology? A case for conservative extensions in de-</article-title>
          <source>Conf. on Arti¯cial Intelligence</source>
          ,
          <year>2007</year>
          .
          <article-title>scription logics</article-title>
          . In P. Doherty,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          , and C. Welty, editors,
          <source>Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning</source>
          , 7 Appendix AAAI Press,
          <year>2006</year>
          ,
          <volume>187</volume>
          {
          <fpage>197</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          and
          <string-name>
            <surname>V.</surname>
          </string-name>
          <article-title>Honavar: Ontology language extensions As shown in [23]: to support localized semantics, modular reasoning, and collaborative ontology design and ontology reuse. Tech- { for each SHOIQ concept C, one of the following nical report</article-title>
          , Iowa State University,
          <year>2004</year>
          . holds:
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <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>
            <given-names>F. van Harmelen</given-names>
            , L. Ser- ²
            <surname>CI[</surname>
          </string-name>
          <article-title>¢ = CI for all I and ¢</article-title>
          , ¢ \ ¢I = ;
          <article-title>(such a¯ni, and</article-title>
          <string-name>
            <given-names>H.</given-names>
            <surname>Stuckenschmidt: C-OWL</surname>
          </string-name>
          :
          <article-title>Contextualiz- C is said to be local ); ing Ontologies</article-title>
          .
          <source>In Proc. of the Second Int. Semantic Web Conf.</source>
          , Springer,
          <year>2003</year>
          ,
          <volume>164</volume>
          {
          <fpage>179</fpage>
          . ² CI[
          <article-title>¢ = CI [ ¢ for all I and ¢</article-title>
          , ¢ \ ¢I = ;
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>B.C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Sirin</surname>
          </string-name>
          <article-title>: Combining OWL (C is non-local ). ontologies using E-Connections</article-title>
          . Web Semantics: Sci- {
          <article-title>If R is a SHOIQ role, then RI[¢ = RI for all I ence</article-title>
          ,
          <source>Services and Agents on the World Wide Web</source>
          ,
          <volume>4</volume>
          , and ¢,
          <source>¢ \ ¢I = ;. 1</source>
          ,
          <year>2006</year>
          ,
          <volume>40</volume>
          {
          <fpage>59</fpage>
          .
          <article-title>{ A SHOIQ ontology is not local i® it explicitly</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>J.Z. Pan</surname>
            , L. Sera¯ni, and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          <article-title>: Semantic import: contain a GCI D v C such that C is local and D an approach for partial ontology reuse</article-title>
          . In P. Haase, is non-local. V.
          <string-name>
            <surname>Honavar</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Kutz</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Sure</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Tamilin, editors,
          <source>Proc. of the 1st Int. Workshop on Modular Ontologies</source>
          , volume
          <volume>232</volume>
          , CEUR-WS.org,
          <year>2006</year>
          .
          <article-title>Lemma 1 (Auxiliary). Let ® be a SHOIQ axiom,</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>M. Boris</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          <string-name>
            <surname>Grau</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fokoue</surname>
          </string-name>
          ,
          <article-title>I an interpretation and ¢ a set disjoint with ¢I . and</article-title>
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Lutz: OWL 2 Web Ontology Language: Pro- Then I 6j= ® implies I[¢ 6j= ®. ¯les. W3C draft</article-title>
          ,
          <issue>W3C</issue>
          ,
          <year>2009</year>
          . Available at http:// www.w3.org/TR/2009/CR-owl2
          <string-name>
            <surname>-</surname>
          </string-name>
          profiles-20090611/. Proof.
          <article-title>Suppose that I 6j= ®.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>N.F.</given-names>
            <surname>Noy</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.L.</given-names>
            <surname>Mcguinness</surname>
          </string-name>
          :
          <article-title>Ontology develop- If ® is of the form C v D that means CI 6µ DI (?). For ment 101: a guide to creating your ¯rst ontology. C, D local, we have CI[¢ = CI and DI[¢ = DI</article-title>
          . By
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>