<!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>The Justi catory Structure of OWL Ontologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Samantha Bail</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bijan Parsia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ulrike Sattler</string-name>
          <email>sattler@cs.man.ac.ukg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>The University of Manchester Oxford Road</institution>
          ,
          <addr-line>Manchester, M13 9PL</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Current ontology development tools o er debugging support by presenting justi cations for entailments of OWL ontologies. In many cases even a single entailment may have many distinct justi cations, and justi cations for distinct entailments may be critically related. We call the set of relations between multiple justi cations the justi catory structure of an ontology. A restricted analysis of justi catory structure has already been successfully exploited to reduce e ort when debugging ontologies with large numbers of unsatis able classes by identifying root unsatis able classes. In this paper we present a preliminary analytical framework for the justi catory structure of an ontology and explore possible applications.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Explanation support signi cantly improves the user experience when working
with OWL ontologies. With regard to the task of debugging it is often impossible
to nd the cause of an erroneous entailment, such as an unsatis able class,
without any tools that guide the user to the source of the error [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Di erent
methods have been developed to assist ontology developers in understanding and
repairing the errors, such as pinpointing, model exploration, and justi cations
[
        <xref ref-type="bibr" rid="ref1 ref12">12, 1</xref>
        ].
      </p>
      <p>
        Justi cations are minimal subsets of the ontology that are su cient for an
entailment to hold. Explanation support through justi cations is currently
provided by ontology development tools such as Protege 4. Current research mainly
focuses on making individual justi cations easier to understand, for example
through de ning ne-grained justi cations [
        <xref ref-type="bibr" rid="ref10 ref5">10, 5</xref>
        ] and analysing patterns [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Another important aspect that is being explored is the e cient computation
of justi cations, in particular nding all justi cations for an entailment [
        <xref ref-type="bibr" rid="ref11 ref13">11, 13</xref>
        ],
and dealing with inconsistent ontologies [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. However, there has been relatively
little research into using justi cations as a way to obtain further information
about an ontology.
      </p>
      <p>
        We are now interested not only in what justi cations can tell us about an
entailment, but also how the relationships between justi cations a ect the entire
ontology, the understanding of the user, and potential repair strategies in the
debugging process. Measuring metrics in order to assess properties like the
cohesion of an ontology has been the focus of previous research [
        <xref ref-type="bibr" rid="ref16 ref3">3, 16</xref>
        ], and di erent
approaches have been implemented in user-oriented tools [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ]. However, the
existing frameworks only consider the class hierarchy and axiom metrics, and do
not make use of the information provided by the justi cations for entailments of
the ontology.
      </p>
      <p>In this paper we introduce the justi catory structure of OWL ontologies,
that is, metrics describing the occurrences of multiple justi cations, as well as
dependencies and other relations between justi cations in an ontology. We show
that these structural properties describe important and useful information to
the users, which can help them understand entailments and their origins by
providing deeper insight into the ontology. In order to show the usefulness of
this approach, we outline potential application areas and explain which aspects
of the justi catory structure can be used in the respective context.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Preliminaries</title>
      <p>2.1</p>
      <sec id="sec-2-1">
        <title>OWL Syntax and Notation</title>
        <p>In this paper, we use the OWL Manchester Syntax1 and following notation: O
for an ontology, A; B; : : : for class names, r and s for property names, and a for
an individual. Axioms can be of the form (Class: C SubClassOf: D) or (Class: C
EquivalentTo: D), where C and D are class expressions that are built from class
and property names.2 An entailment of an ontology O is written as O j= .
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Justi cations</title>
        <p>
          Typically, not all axioms in an ontology are needed to cause an entailment to
hold. In many cases a small subset of the ontology is already su cient. Working
with these subsets when trying to understand the reason for an entailment has
shown to be much easier than having to deal with the full ontology [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Justi
cations are minimal subsets of an ontology O that cause an entailment to hold.
They are are de ned as follows [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]:
De nition (Justi cations) J is a justi cation for O j=
for all J 0 J , it holds that J 0 2 .
if J
        </p>
        <p>O; J j=
and,</p>
        <p>The unsatis ability of a class is a particularly relevant entailment in the
debugging process, as it commonly represents a modelling error in the ontology. A
class A is unsatis able wrt. an ontology O if O j= (A SubClassOf: owl:Nothing).
An ontology that contains unsatis able classes is called incoherent, as shown in</p>
        <sec id="sec-2-2-1">
          <title>1 http://www.w3.org/TR/owl2-manchester-syntax</title>
          <p>2 For legibility and space reasons, we omit several parts of the Manchester syntax,
including declarations and the leading Class:. The complete examples can be accessed
at http://owl.cs.manchester.ac.uk/explanation/owled2010.
this simple example where class C is unsatis able:
O = fC SubClassOf : A and D</p>
          <p>A SubClassOf : E and B
B SubClassOf : not D and r some D
F SubClassOf : r only A</p>
          <p>D SubClassOf : s some owl : T hingg j= C SubClassOf : owl : N othing
Here, there exists only one justi cation for the unsatis ability of C, which is
the set of the rst three axioms. It is obvious that the error is much easier to
spot once we know which axioms to focus on, rather than examining the whole
ontology. Often, there exist multiple justi cations for one entailment, and it is
not unusual to have ten or more justi cations per entailment, as shown in table
2.</p>
          <p>
            With respect to debugging, it is often the task to nd a repair that \breaks"
the entailment. This can be achieved by removing one axiom from each
justication from the ontology [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]. Since axioms are removed from the ontology, a
repair can a ect not only the entailment in question, but also other entailments.
In order to have minimal unwanted impact on the ontology, it is helpful to nd a
repair that is as small as possible. This means that axioms occurring in multiple
justi cations are suitable candidates for removal.
          </p>
          <p>While incoherence can be regarded as a modelling error that needs to be
repaired, a large number of actively used ontologies do in fact contain unsatis able
classes. This does not cause any further problems, unless statements are added
that lead to a contradiction in the knowledge base. For example, if the axiom
(Individual: a Types: C) was added to the example above, the ontology would
be rendered inconsistent, since it would require an instance of an uninstantiable
class.</p>
          <p>
            The term ne-grained describes justi cations whose axioms do not contain
any super uous information [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ]. Laconic justi cations are particularly helpful
with respect to understanding justi cations, as they allow the user to focus on
the relevant parts of an axiom. There can be more or less laconic than regular
justi cations.
3
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>The Justi catory Structure of an Ontology</title>
      <p>We identify a set of relations that represent di erent aspects of the justi catory
structure of an OWL ontology. These aspects can be classi ed into: quanti
able properties of justi cations in an ontology (metrics), information about the
syntactic relations of justi cations, and semantic relationships between justi
cations.
3.1</p>
      <sec id="sec-3-1">
        <title>Multiple Justi cations</title>
        <p>Multiple justi cations can be regarded in the context of single entailments, as
well as for multiple distinct entailments. In the following we mainly discuss
the occurrence of multiple justi cations for a single entailment, namely inferred
atomic subsumptions and unsatis able named classes.</p>
        <p>There are two interesting aspects when dealing with multiple justi cations,
which we denote as coping and exploiting. Firstly, when seen from a debugging
point of view, we can ask: how can we cope with this potentially large number of
justi cations? Is it possible to nd useful information about their interactions,
which could simplify the repair process? Based on ndings from preliminary
experiments with 16 ontologies (all available from the TONES3 repository), it
is easy to see that multiple justi cations do occur in ontologies.</p>
        <p>While the set of ontologies presented in table 1 is not representative of all
ontologies, it illustrates di erent properties and phenomena that can occur in
ontologies of various sizes and expressivities. Table 2 shows the average
number of regular and laconic justi cations (AvgR, AvgL), as well as the respective
maxima (MaxR, MaxL) measured in our experiments. It also lists the
number of unsatis able classes (UC) and how many of these are root unsatis able
(RUC). The number of regular justi cations per entailment in our test set di ers
# Ontology Expressivity Axioms Entailments
1 MGEDOntology ALEOF (D) 4679 2
2 DOLCE Lite SHIF 536 3
3 Mini Tambis ALCN 400 65
4 Nautilus ALCHF 172 10
5 Generations ALCOIF 60 24
6 Mereology SHIN 80 2
7 Relative Places SHIF 130 7
8 Cell EL + + 14743 11
9 People + Pets ALCHOIN 370 33
10 University SOIN (D) 92 10
11 Numerics SHIF (D) 478 3098
12 Earth Realm ALCHO 1613 2751
13 Economy ALCH(D) 2330 51
14 Programmes SHIF (D) 560 51
15 Adolena SRIQ 415 3
16 Chemical ALCHF 192 43
strongly, ranging from exactly one justi cation (e.g. Mini Tambis, Nautilus) to
24 (DOLCE Lite). The average number of regular justi cations per entailment
is 1.8, with an average size of 3.3 axioms. Note that in some cases, entailments
with single regular justi cations have multiple laconic ones. The extreme cases
in particular, where up to 68 laconic justi cations are obtained for a single
entailment, show that it is necessary to develop methods that help users cope with
such a large number of justi cations.
3 http://owl.cs.manchester.ac.uk/repository</p>
        <p>Exploiting refers to a di erent aspect of multiple justi cations: is it possible to
utilize this phenomenon in order to obtain information about the ontology itself?
In which way do the relationships between justi cations a ect other properties
of the ontology, and vice versa? For example, regarding the results from our
experiments, we would like to learn why there are such signi cant di erences in
the numbers of justi cations for each ontology. From these considerations also
follows the question of how this information can then be made accessible to the
user, suited to the required task.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Metrics</title>
        <p>Simple statistics about the justi cations found in an ontology can provide an
insight into its structure and connectedness, which will be discussed in section
4. These statistics include the number and size of regular justi cations for a single
entailment, the number and size of laconic justi cations for a single entailment
and their respective ratios.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Syntactic Relations Between Justi cations</title>
        <p>Subset Relationships One of the most important syntactic relationships is
the containment of one justi cation in another. This property has been utilised
in the de nition of root and derived unsatis able classes, which are relevant for
the debugging and repair process.</p>
        <p>
          Presenting justi cations to the user and distinguishing root and derived
unsatis able classes has shown to drastically reduce user e ort when debugging
an ontology that has multiple unsatis able classes [
          <xref ref-type="bibr" rid="ref8 ref9">9, 8</xref>
          ]. The intuitive de nition
is as follows: Derived unsatis able classes depend on the unsatis ability of
another class (the parent of the derived unsatis able class) and may be xed (i.e.
made satis able) by simply repairing this parent. It is possible for a derived
unsatis able class to depend on multiple parent classes. Root unsatis able classes
are classes whose unsatis ability does not depend on another class. The precise
de nition translates this into a statement about subsets of justi cations [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
De nition (Root and derived unsatis able classes) A class C that is unsatis able
with respect to an ontology O is derived unsatis able if there exists a
justication J for O j= (C SubClassOf: owl:Nothing), and a justication J 0 for O j= (D
SubClassOf: owl:Nothing) such that J 0 J . An unsatis able class that is not a
derived unsatis able class is known as a root unsatis able class.
        </p>
        <p>In the following example, O entails the unsatis ability of both C and A,
J1 =fC SubClassOf: D, C SubClassOf: not Dg and J2 = O being the respective
justi cations:</p>
        <p>O = fA SubClassOf : r some C</p>
        <p>C SubClassOf : D</p>
        <p>C SubClassOf : not Dg j= A SubClassOf : owl : N othing
A is a derived unsatis able class, as its justi cation J2 is a strict superset of
the justi cation J1 for the unsatis ability of C. We can also say that J1 causes
the unsatis ability, while J2 propagates it. By repairing C's unsatis ability (for
example by removing the third axiom from the set), class A will also be repaired.
In terms of debugging unsatis able classes, this shows that by repairing the root
unsatis able classes rst all the derived unsatis able classes may be xed at the
same time.</p>
        <p>
          In some ontologies, such as Tambis,4 which contains 144 unsatis able classes,
it has been shown that nearly all of the derived unsatis abilities (111 in Tambis)
could be repaired by simple xing a small number of root unsatis able classes
(only 3 in the case of Tambis) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. This dependency can be clearly used in helpful
tool support and depends largely on the structure of the ontology.
Equality This concerns the case where multiple justi cations for di erent
entailments contain exactly the same axioms. This simply means that the same set
of axioms has multiple entailments and happens to be a justi cation, i.e.
minimal, for all these entailments. J1 = fA SubClassOf: B, B SubClassOf: C and Dg
for example is a justi cation for two entailments that are atomic subsumptions,
namely (A SubClassOf: C) and (A SubClassOf: D). When looking at laconic
justi cations only, we obtain two distinct justi cations for the entailments and the
equality does no longer hold. This provides information about the modelling as
well as potential redundancies in the ontology, and it clearly shows the relevance
of laconic justi cations for the comprehensibility of explanations.
        </p>
        <sec id="sec-3-3-1">
          <title>4 http://www.cs.man.ac.uk/ stevensr/tambis</title>
          <p>
            Intersection As a more general case of subset relations, intersection provides
a starting point when developing a repair strategy for breaking an entailment.
Again, we only consider syntactical overlap here, i.e. multiple justi cations
sharing a common axiom. Removing only one axiom that occurs in the overlapping
parts of multiple justi cations for a single entailment can lead to a repair that
has less impact on the rest of the ontology. This is desirable, as repairs should
be minimal and ideally only a ect the entailment in question [
            <xref ref-type="bibr" rid="ref12 ref8">8, 12</xref>
            ].
3.4
          </p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>Semantic Relationships</title>
        <p>Entailment It is possible for justi cations to entail each other. This can be
both unidirectional (J1 j= J2, J2 2 J1) and bidirectional (J1 j= J2, J2 j= J1). A
special case of entailment is a subset relationship, as a set of axioms naturally
entails its subsets.</p>
        <p>
          Masking A special case of dependencies between justi cations is the
phenomenon of masking [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. This describes the interaction of justi cations (and
other axioms that are not part of the justi cation) that conceal the actual
number of explanations, as demonstrated in the following example.
        </p>
        <p>O = fA SubClassOf : B and not B and C</p>
        <p>C SubClassOf : D and not Dg
j= A SubClassOf : owl : N othing
The only justi cation is J1 =fA SubClassOf: B and not B and C g, and there
are no root / derived relationships. If we attempt to break the entailment, for
example by removing (not B) from the justi cation, it still holds because of the
unsatis ability now being derived from the second axiom. This gives us another
justi cation for the entailment, namely J2 = O, which is clearly a superset of J1.
This case is not captured by the above de nition for derived justi cations, as a
superset of a justi cation for the same entailment is by de nition not a justi
cation (due to the minimality constraint). However, we lose valuable information if
this dependency of J2 on J1 is not pointed out to the user in the repair process.
Shared Cores Masking Shared cores describe a particular type of masking,
where the justi cations have parts that are structurally equal. This is illustrated
by the following example:</p>
        <p>O = fA SubClassOf : B and not B and C</p>
        <p>A SubClassOf : B and not Bg
j= A SubClassOf : owl : N othing
The part (and C) can be removed from the justi cation J1 = fA SubClassOf: B
and not B and C g, as it is not relevant for the entailment to hold. This leads to
the laconic version of J1, which is syntactically equal to J2 = fA SubClassOf:
B and not B g. If this phenomenon is pointed out to the user, they can easily
see that there exists only a single reason for an entailment rather than several,
which they can then focus on in the repair process.
3.5</p>
      </sec>
      <sec id="sec-3-5">
        <title>Classifying Justi catory Structure</title>
        <p>De ning or classifying the justi catory structure of an ontology with respect to
some metric allows to investigate how the structure a ects the ontology and vice
versa. We can potentially categorise di erent types of justi catory structure
intuitively, based on their complexity: a weak justi catory structure exhibits only
a small average number of mostly disjoint justi cations, such as one justi cation
per entailment. An ontology with a strong (complex) justi catory structure
comprises a large number of justi cations for each entailment and a high degree of
interconnectivity (intersections, subset relationships, entailment) between them.
Extensive experiments will allow us to identify the aspects of justi catory
structure and their respective weights that are most suitable for specifying a metric
to classify it.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Application</title>
      <p>In this section, we provide an overview of potential applications of analysing the
justi catory structure. These cover a wide range of potential users from ontology
engineers to reasoner developers, as well as both task-speci c and global usage
in the ontology development process.
4.1</p>
      <sec id="sec-4-1">
        <title>Debugging</title>
        <p>One of the main tasks that explanation deals with is debugging support in the
ontology engineering process. First of all, by making use of the information about
dependencies between justi cations, the user can be guided to understand the
cause of an entailment. The information can then be used to provide a suitable
repair strategy, that allows the user to amend the entailment without causing
unwanted changes to the ontology. We use the abstract term information here,
as there exist di erent levels of interaction with the user: we can provide raw
data, such as J1 J2, which can already be helpful for experienced users. By
embedding this information into a more user-friendly representation and
exploiting it in tools, such as a visualisation interface, understanding dependencies and
their impact on entailments can be made more accessible to the user.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Ontology Comprehension</title>
        <p>
          Explanation support for ontology comprehension can be considered di erent
from using justi cations for debugging, as it is less task-based and success is
harder to de ne: what exactly does understanding the ontology mean? One way
of de ning ontology comprehension is based on the ability to answer questions
relating to information in the ontology, as previously shown in a user study
[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. We believe that structural information about the ontology in a suitable
representation can help the user understand the dependencies between axioms,
the modelling choices that were made, and even help them to spot non-logical
errors that cannot be detected with the help of a reasoner.
In addition to debugging and ontology comprehension, the suggested metrics
can also provide useful data when analysing ontologies and developing tools.
In addition to metrics such as the expressivity of an ontology and the number
of classes and axioms, the justi catory structure o ers a way of describing and
classifying ontologies. This relates to the notion of axiomatic richness, which
describes the expressiveness and use of interesting, non-trivial class expressions
in an ontology.
        </p>
        <p>Thus far, axiomatic richness has no formal de nition and is more of an
abstract concept than a measurable property. As an example, taxonomic ontologies
containing only trivial axioms of the form (A SubClassOf: B) are commonly
regarded as axiomatically weak. A simple indicator for axiomatic richness could
be a large average number of justi cations for entailments. Reasoner
development and testing can be regarded as another potential application area of the
justi catory structure. We can ask: does a certain type of justi catory structure
make reasoning harder? Again, this hypothesis has to be tested in more extensive
experiments.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we have presented a framework for analysing the various
dependencies between justi cations in OWL ontologies, which are believed to o er useful
structural information about an ontology. We have shown that there exists a
number of interactions between justi cations, such as syntactic overlap and
entailment. The di erent aspects of this justi catory structure of an ontology were
grouped into syntactical connections, semantic relations and metrics. Services
using the justi catory structure in the ontology development process could
support users with debugging tasks, assist in understanding ontologies and provide
metrics for classifying ontologies.</p>
      <p>For future work, we aim to de ne the di erent aspects of the justi catory
structure of an ontology more clearly. In the long term, algorithms and services
will be developed that generate and use the data, which can then be presented
to the user in a way tailored to the respective task. Examining di erent forms
of visualisation for this purpose o ers another extension to the topic discussed
in this paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>J.</given-names>
            <surname>Bauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Sattler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          .
          <article-title>Explaining by example: Model exploration for ontology comprehension</article-title>
          .
          <source>In Description Logics</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>O.</given-names>
            <surname>Corcho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Roussey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M. V.</given-names>
            <surname>Blazquez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Perez</surname>
          </string-name>
          .
          <article-title>Pattern-based OWL ontology debugging guidelines</article-title>
          .
          <source>In WOP</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>A.</given-names>
            <surname>Gangemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Catenacci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ciaramita</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          .
          <article-title>A theoretical framework for ontology evaluation and validation</article-title>
          .
          <source>In SWAP</source>
          ,
          <year>2005</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>J.</given-names>
            <surname>Bauer</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>Understanding entailments in OWL</article-title>
          . In OWLED,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <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>Laconic and precise justi cations in OWL</article-title>
          . In International Semantic Web Conference, pages
          <volume>323</volume>
          {
          <fpage>338</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <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="ref7">
        <mixed-citation>
          7.
          <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>Justi cation masking in OWL</article-title>
          . In Description Logics,
          <year>2010</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>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>
          . Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <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>J.</given-names>
            <surname>Hendler</surname>
          </string-name>
          .
          <article-title>Debugging unsatis able classes in OWL ontologies</article-title>
          .
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <volume>268</volume>
          {
          <fpage>293</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>J. Lam</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Sleeman</surname>
            , and
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Vasconcelos</surname>
          </string-name>
          .
          <article-title>A ne-grained approach to resolving unsatis able ontologies</article-title>
          .
          <source>In Web Intelligence</source>
          . Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>S.</given-names>
            <surname>Schlobach</surname>
          </string-name>
          .
          <article-title>Diagnosing terminologies</article-title>
          .
          <source>In AAAI</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>S.</given-names>
            <surname>Schlobach</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Cornet</surname>
          </string-name>
          .
          <article-title>Non-standard reasoning services for the debugging of description logic terminologies</article-title>
          .
          <source>In IJCAI</source>
          , pages
          <volume>355</volume>
          {
          <fpage>362</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>B.</given-names>
            <surname>Suntisrivaraporn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ji</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Haase</surname>
          </string-name>
          .
          <article-title>A modularization-based approach to nding all justi cations for OWL DL entailments</article-title>
          .
          <source>In ASWC</source>
          , pages
          <volume>1</volume>
          {
          <fpage>15</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>S.</given-names>
            <surname>Tartir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. B.</given-names>
            <surname>Arpinar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Sheth</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Aleman-Meza</surname>
          </string-name>
          .
          <article-title>OntoQA: Metric-based ontology quality analysis</article-title>
          .
          <source>In ICDM</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Tello</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Gomez-Perez</surname>
          </string-name>
          .
          <article-title>Ontometric: A method to choose the appropriate ontology</article-title>
          .
          <source>Journal of Database Management</source>
          ,
          <volume>15</volume>
          (
          <issue>2</issue>
          ):1{
          <fpage>18</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. H.
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Orme</surname>
            , and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Etzkorn</surname>
          </string-name>
          .
          <article-title>Cohesion metrics for ontology design and application</article-title>
          .
          <source>Journal of Computer Science</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <volume>107</volume>
          {
          <fpage>113</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>