<!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>Explaining by Example: Model Exploration for Ontology Comprehension</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Johannes Bauer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ulrike Sattler</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>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science, The University of Manchester</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactively. We also discuss the issues involved in using tableau reasoners for the generation of models for model exploration and report on a user study we conducted on our prototype implementation, SuperModel, to evaluate its e ectiveness in supporting users in understanding an ontology.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Motivation</title>
      <p>At di erent stages of an ontology's life-cycle, the people working with it require
some sort of understanding of it; e.g. which parts of it encode what piece of
knowledge explicitly or implicitly, how it is meant to be used on its own or
in conjunction with other ontologies, and if and where it is broken and how it
may be xed. Tool support is necessary to achieve these kinds of understanding,
as ontologies can be as broad and complicated as the elds of knowledge they
model, and as it is easy to get lost in the highly complex interactions between
the large numbers of logical axioms they comprise.</p>
      <p>This need is testi ed and partially met by the impressive tool support which
has recently become available. However, support facilitates use and use spawns
demand for more support. Thus, the very increase in popularity of ontology
engineering brought about by ontology editors, visualization, justi cations, etc.
may be seen as one reason for the demand for even more support.</p>
      <p>Looking at anecdotal evidence, we found that some DL experts liked to use
pen and paper to visualize models of ontologies to explain or check some of their
lesser obvious implications. Our idea was that the automatic generation and
presentation of such models could similarly aid the understanding of ontologies.</p>
      <p>Think, for example, of an ontology stating that a Nobleman is someone who
is the son of a Nobleman, and a Commoner is someone who is not a Nobleman. One
might be surprised to see that a Commoner can have a son who is a Nobleman.
However, the example depicted in Fig. 1, where that Nobleman is at the same
time the son of both a Commoner and a Nobleman, should immediately clear up
the situation and make it obvious that the ontology lacks a statement saying
that no-one can be son of two men.</p>
      <p>Problems like the one discussed above may creep up even if one has a fair
understanding of the ontology in question because rst, in order to understand,
in our example, why a Nobleman may have a Commoner father, one would have to
know what axioms to look at, and secondly keep track of the possibly complex
interactions of these axioms|or theyr failure to interact.</p>
      <p>i2
hasSon</p>
      <sec id="sec-1-1">
        <title>Commoner</title>
        <p>hasSon</p>
      </sec>
      <sec id="sec-1-2">
        <title>Nobleman</title>
        <p>i3
i1</p>
      </sec>
      <sec id="sec-1-3">
        <title>Nobleman</title>
        <p>
          This paper is based on [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], in which we developed the notion of model
exploration from these observations. Informally, model exploration is the activity
of interactively generating and visualizing models for concepts in ontologies in
order to learn something about the concept/ontology. The details are eshed out
in Section 3. In Section 6 we report on a user study we conducted on our model
exploration prototype, SuperModel, to evaluate the merits of model exploration.
2
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Notation</title>
      <p>
        In this paper, we use standard DL terminology, syntax and semantics as de ned
e.g. in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Additionally, we will use C and D for concept descriptions, i, i1, i2. . .
for individual names, r for role names, R for roles, and C, R, and NI for sets of
concepts, roles, and individual names.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Model Exploration</title>
      <p>The idea behind model exploration is that it may be useful for users to see
models of concepts in an ontology to understand their semantics. Unfortunately,
there may be very many (even in nitely many) very big (in nitely big) models
of a given concept. What we hope is that seeing small parts of just a few models
su ces in many cases to give users the information they seek. This is why model
exploration includes an interactive component which lets the user decide which
parts of what models to see.</p>
      <p>Model exploration is an activity cycling through the stages of model speci
cation, model generation, and model inspection (see Fig. 2). In the rst stage, the
users add axioms to an ABox which serve as constraints for the type of model
they want to see next. In model generation, a completion graph for this
constraint ABox is computed and adorned with additional information. In model
inspection, a connected subgraph, the model excerpt, of this completion graph
is presented graphically to the user and may be expanded (explored) along the
edges of the completion graph.</p>
      <p>The rst constraint ABox is obtained from the user-speci ed root concept Cr
by adding the assertion Cr(ir) to an empty ABox. The model excerpt always
includes the root individual ir.</p>
      <p>Cr(ir)</p>
      <sec id="sec-3-1">
        <title>Constrain Model</title>
      </sec>
      <sec id="sec-3-2">
        <title>Inspect Model</title>
      </sec>
      <sec id="sec-3-3">
        <title>Generate Model</title>
        <p>To make the presentation of the rest of this section easier, we will assume,
without loss of generality, models in which, for every individual in its domain,
there is an individual name which it maps to that individual. We can then
refer to individuals in an interpretation by their individual name and describe
interpretations and their corresponding graphs by sets of ABox axioms in a
straightforward manner: we say that A describes an interpretation I, if
A = fC(i) j C 2 C; i 2 NI ; iI 2 CI g</p>
        <p>[ fR(i; i0) j r 2 R; i; i0 2 NI ; (iI ; i0I ) 2 RI g</p>
        <p>Let I = ( I ; I ) be an interpretation. We then de ne the graph corresponding
to I as the graph GI = (V; E; LV ; LE ) where</p>
        <p>V =</p>
        <p>I ;
E = V 2;</p>
        <p>LV : V ! C2; LV (i) = fC 2 C j i 2 CI g</p>
        <p>2</p>
        <p>LE : E ! R ; LE (e) = fR 2 R j e 2 RI g:
It is obvious that an interpretation I and its corresponding graph GI are
intertranslatable.</p>
        <p>A model for an ABox must satisfy all of the ABox's axioms, and thus it is
easy to see that an ABox always is a subset of every set A describing a model for
it. This lets us de ne a function asrt(), for `asserted', on edge- and node labels
of a graph GI corresponding to a model I for an ABox A:</p>
        <p>Let C be a concept, R a role and i, i0 individual names. Then
asrt(C; iI ) =
(1 if C(i) 2 A;
0 otherwise.</p>
        <p>and
asrt(R; (iI ; i0I )) =
(1 if R(i; i0) 2 A;
0 otherwise.</p>
        <p>Another observation is that, for some ABoxes, there are assertions which
are in every set describing a model for these ABoxes, but not in the ABoxes
themselves. In fact, we would like to generalize this: consider the models for the
ABox A = f(9r:C)(ir)g. In all models for A, ir will have an r-successor which
is a C. Thus, all models of A satisfy an axiom r(ir; i1) for varying individual
names i1.</p>
        <p>This is a commonality which we believe is worth pointing out when visualizing
a model. Thus, we would like to de ne a function mnd(), for `mandatory', on
node and edge labels such that, if, in a model, i1 is the name of that r-successor,
then mnd(r; (irI ; i1I )) = 1 and mnd(C; i1) = 1.</p>
        <p>Now, while asserted node and edge labels are asserted independently of each
other, they can only be de ned to be mandatory in relation to each other:
consider the concept de nition D v 9p:A u 9p:B u 9p:C u 2 p and the models
depicted in Fig. 3, which are the alternatives created for D by a standard tableau
reasoner.</p>
        <p>(a) Alternative 1
(b) Alternative 2
(c) Alternative 3
A,B
p
i1</p>
        <p>D
ir
p</p>
        <p>C
i2</p>
        <p>A
p
i1</p>
        <p>D
ir
p</p>
        <p>B,C
i2</p>
        <p>A,C
p
i1</p>
        <p>D
ir
p</p>
        <p>B
i2</p>
        <p>Either of the sets fD(ir); p(ir; i1); A(i1)g and fD(ir); p(ir; i1); B(i1)g could
be said to be a set of mandatory axioms1 in the sense that a similar set of axioms
is satis ed by every model of D.</p>
        <p>No such set should contain the axioms A(i1) and B(i1), because in other
models, the p-successors of the instance of D which are an A and a B, respectively,
are not the same, as can be seen in Figs. 3b and 3c.</p>
        <p>In order to be useful for users of model exploration, a de nition for labels
being mandatory needs to be simple enough to work with in practice, yet capture
a meaningful notion of commonalities of all models of an ontology and a concept.
We believe that the following de nition strikes a good compromise:</p>
        <p>A set of ABox axioms S is a mandatory superset of an ABox A w.r.t. an
ontology O, if S includes A and every model for A and O can be transformed
into a model for O and all the axioms in S only by changing its interpretation
of individual names occurring in S but not in A or O.</p>
        <p>
          For a model I of an ABox A and a mandatory superset S of A, we de ne
a function mnd() on node and edge labels C 2 C and R 2 R, resp., and nodes
fiI ; i0I g I ; fi; i0g NI in a graph corresponding to I as follows:
1 modulo renaming of individuals not occurring in ontology or constraint ABox, see [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
mnd(C; iI ) =
(1 if C(i) 2 S;
0 otherwise
and
mnd(R; (iI ; i0I )) =
0
otherwise.
        </p>
        <p>
          Let GI be the graph corresponding to an interpretation based on a
completion graph. If that completion graph was generated by a tableau reasoner
using dependency sets for backjumping [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ], then a function mnd() can be
derived from information about the dependency sets of labels in the completion
graph [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]: for a label of a node or edge in GI , mnd() is 1 exactly if the dependency
set for the corresponding label in the completion graph is empty.
        </p>
        <p>Our prototype implementation of model exploration, SuperModel,2 follows
the approach described in this section and uses dependency sets to obtain a
mandatory superset and include it in its visualization of models.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Model Generation</title>
      <p>
        For a model to be explored, it must be generated. Since model generation is
the basis of tableau reasoning in DLs, there is a large body of work dealing
with exactly this problem|we used FaCT++ [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], a state-of-the-art, open-source
tableau reasoner for the SROIQ(D) description logic, to generate models for
model exploration.
      </p>
      <p>We said model generation was the basis of tableau reasoning, because the
completion graphs generated by today's reasoners have a certain correspondence
with models but they are not equivalent. Also, certain optimizations employed
in automatic reasoners make the information found in these graphs incomplete
from the point of view of model exploration. This section deals with the issues
involved in using practical tableau reasoners to generate completion graphs for
model exploration.</p>
      <p>Complex Roles: the trouble with transitive roles and general role inclusion
axioms (RIA) for model exploration is that tableau algorithms usually treat
transitivity and RIAs rather indirectly [6{9].</p>
      <p>Thus, completion graphs do not always contain an edge for every role
relationship in the corresponding model. In order to be able to visualize models,
these role relationships need to be added. This is easy for simple super-roles.
We left adding roles implied by transitivity or general RIAs for future work
because we wanted to test the general approach rst before going into the details
of how to accommodate the possibly large numbers of additional arcs in our
visualization.</p>
      <p>
        Blocking: tableau algorithms for DLs which lack the nite model property
usually use blocking [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ] to ensure termination. A model exploration system
can point out blocked nodes and blockers in the model visualization or clone
blockers' successors on demand to allow in nite exploration of a model.
2 downloadable at http://www.man.ac.uk/ bauerj/supermodel/
Caching: caching is a common optimization technique in tableau reasoners [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ];
in order for it to produce unpruned completion graphs, caching needs to be
disabled in a reasoner for model exploration.
      </p>
      <p>
        Preprocessing: told cycle and synonym elimination [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] are forms of
preprocessing which make a knowledge base easier to reason with. A consequence of
these techniques is that, from a set of equivalent named concepts, only some may
be in a completion graph node's label. The others need to be added for model
exploration.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Related Work|Tool Support for Ontology Authors</title>
      <p>A number of tools have been developed over the years to help users of
ontologies understand them in the broader sense. This section discusses classes and
examples of these tools to get a perspective of the landscape around model
exploration.</p>
      <p>
        We group these classes into two categories: rst, and predominantly, there
are axiom inspection tools, whose purpose it is to make the axioms of an ontology
and their logical implications more accessible. Ontology editors like Swoop [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],3
Protege 4,4 and OBOEdit,5 visualizations for various purposes like the ones
discussed in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], as well as justi cations [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], query tools, ontology metrics
analyzers etc. are examples.
      </p>
      <p>Secondly, there are model inspection tools, which generate models for
ontologies and one way or another present them to users.</p>
      <p>
        An e ort to generate and visualize models for OWL ontologies is described
in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], introducing the music score notation. This notation is in fact original,
but it has the drawback of not being very easy on the screen size it uses for
visualization, as the authors note.
      </p>
      <p>
        Tweezers [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], extracts models from the Pellet DL reasoner [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] to aid a very
speci c way of understanding an ontology: along with its other features, model
inspection is to help nding those parts of an ontology which make it costly or
impossible to reason with.
      </p>
      <p>
        Garcia et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] propose a translation of ontologies from description
logics into the Alloy Speci cation Language and to have models generated and
presented by the Alloy Analyzer.
      </p>
      <p>None of these model inspection tools allow users to add constraints on the
models as described in Section 3 or show anything similar to the status of
information we discuss in Section 3.1. The relevant papers also do not report on
any empiric evidence of usefulness in general ontology engineering tasks. Only
Tweezers supports in nite models by marking blocked nodes (although without
pointing out the blockers).
3 http://code.google.com/p/swoop/
4 http://www.co-ode.org/downloads/protege-x/
5 http://oboedit.org/</p>
    </sec>
    <sec id="sec-6">
      <title>Testing Usefulness</title>
      <p>
        After implementing model exploration in SuperModel, we conducted a user study
[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] in order to test the usefulness of model exploration for the understanding
of ontologies. For that study, we followed the procedure recommended by [20,
Part II]. The details of our study's preparation and implementation can be found
in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
6.1
      </p>
      <p>Hypotheses
A study tests hypotheses. A user study tests hypotheses about the usability
and usefulness for a particular set of applications of a piece of software. The
hypotheses must be formulated such that they are testable and relevant to the
software's intended use.</p>
      <p>We rst collected a number of hypotheses about what SuperModel could be
useful for, and then, due to the limited time for the user study, selected the
following three hypotheses that we most expected to get positive results for:
Hyp. 1: \SuperModel can be used to understand the reason for a given
entailment."
Hyp. 2: \SuperModel can help nd out, given a concept C, what role
successors an instance of C must/may/may not have and which concepts they
must/may/may not be instances of, and the same about their successors."
Hyp. 3: \When using SuperModel, a user can gain knowledge circumstantial
to the task at hand."</p>
      <p>Since we also wanted to see whether model exploration was a good method
to gain knowledge in these ways, and because we wanted to know, in case of
negative results, whether the problem lied with model exploration or with the
implementation, we tested the following hypotheses, which we hoped to refute:
Hyp. 4: \It is di cult to use model exploration to acquire information about
an ontology."
Hyp. 5: \The complexity of the user interface of SuperModel is high compared
to the actual tasks which it is designed to facilitate."
6.2</p>
      <p>Experiments
We conducted our user study in two phases. The rst and second phase were
primarily meant to test Hyps. 2, and 1, respectively. We gathered evidence relating
to Hyp. 3 and specializations of Hyps. 4 and 5 along the way. The instruments
used to gather data were experimenter's observations, logging of clicks and times,
and questionnaires throughout the experiments.</p>
      <p>In the rst phase, the participants were introduced to a toy ontology that was
designed speci cally for this user study. They were then shown how SuperModel
might be used to answer a question in the style of Hyp. 2, before being asked to
try and answer three similar questions about that ontology.</p>
      <p>In the second phase, they were presented justi cations and asked to try to
understand them. In case they gave up on understanding some justi cation,
they were given the opportunity to try model exploration using SuperModel
on the concepts occurring in the justi cation. The idea was to see whether a
considerable amount of justi cations that at rst were too di cult could be
understood with the help of model exploration.
6.3</p>
      <p>Test Results
Phase 1: the rst phase of the study went fairly successfully: out of the twelve
participants, only two could not answer all of the questions presented to them
satisfactorily. Only two reported they did not enjoy using SuperModel for the
tasks presented to them in this phase of the study.</p>
      <p>y
it
s
n
e
D</p>
      <p>We had estimated ve minutes acceptable to answer the kinds of questions
we asked with a unfamiliar tool. Fig. 4 shows a distribution density function
estimated from our thirty samples, the gray area indicates the middle tercile of
the function and the mark at 252.83s shows the average of our test results. The
rst two terciles are well below the mark of 300s.</p>
      <p>Only a minority of ve participants reported they would have preferred
answering the questions some other way. Comparison with demographic data from
the questionnaires shows that the group of those who preferred SuperModel over
other methods had a higher percentage of self-reported experts in the use of
ontology editors and a lower percentage of self-reported experts of formal logics.
Also, the two failures to answer one of the questions asked in this phase fall into
the group of logic experts who were not ontology editor experts.
Phase 2: out of 58 samples collected in Phase 2, 32 were cases in which
participants initially gave up on a justi cation, out of which 15 were then eventually
understood after activating SuperModel.</p>
      <p>In the questionnaire following the understanding of a task after activating
SuperModel, SuperModel was fully credited with giving the relevant clues only
once. However, in ten cases, participants reported it gave them "some of the
clues" necessary to understand the entailment.</p>
      <p>No conclusive evidence was collected supporting Hyp. 3.</p>
      <p>Post-Test Questionnaire: seven participants thought model exploration was
de nitely useful to understand entailments. Three of these were not sure. None
thought either SuperModel or model exploration in general was useless and
noone believed SuperModel was de nitely useful but maybe model exploration was
not.</p>
      <p>Eight believed model exploration was useful for other tasks related to
ontology engineering, the rest was not sure. Two participants thought SuperModel
was di cult to use; three found it easy, the rest thought it normal.
6.4</p>
      <p>Interpretation
The data for Phase 1 of the experiment suggests that the kind of question asked
in it can indeed be answered in acceptable time using SuperModel. Together
with the demographic data it also suggests that the bene t from SuperModel
increases with familiarity with ontology editors and decreases with knowledge
about formal logics.</p>
      <p>The reason for the former could be that users of ontology editors are used
to graphical environments that actively support them in the understanding of
ontologies. The latter may be caused by experts of formal logics having developed
their own strategies for extracting information from logical theories.</p>
      <p>The fact that, in Phase 2, almost half of the cases where participants could
not understand a justi cation on its own were understood with SuperModel is
encouraging. However, in more than half of those cases, they spent considerably
more time with SuperModel than we hoped they would, and only in two thirds
of the cases they credited SuperModel with giving them at least some of the
clues they needed.</p>
      <p>The measures on usability of SuperModel's UI suggest that there is room
for improvement, but also that the problems are not so grave as to make it
di cult to use. This is consistent with the fact that most participants thought
its usability was at least `normal'.</p>
      <p>We did not nd any signi cant evidence supporting Hyp. 3. The reason for
this may have been that the ontologies were very simple and contained little
information that could have been learned in addition to what was necessary.</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusion</title>
      <p>In this paper, we have introduced model generation, a technique for supporting
ontology engineers in their understanding of ontologies. We have explained how
structures similar to models can be extracted from tableau reasoners and how
the speci c reasoning algorithms a ect the models and additional information
found in these structures. We have discussed the issues and choices involved in
implementing model exploration and produced a prototype whose usefulness was
assessed in a user study.</p>
      <p>The results of this study are encouraging: they suggest that model exploration
can indeed help users answer certain questions about an ontology and, to a
certain degree, to understand justi cations.</p>
      <p>The study has also identi ed starting points for future work both on our
implementation and on model exploration in general.</p>
      <p>On the Prototype: we would like to further develop SuperModel to improve
usability, make it more independent of the speci c reasoner used, and to enable
di erent styles of use.</p>
      <p>On Testing Usefulness: although it did yield valuable results, the study we
report on in this paper is only a pilot study in scope. More pilot studies and
experience with model exploration is needed to identify probable strengths of
model exploration and ways to con rm them in an in-depth user study with
more intense experiments. Apart from that, the use of mandatory information
should be evaluated.</p>
      <p>On Model Exploration: we would like to explore the possibilities and options
for handling transitive roles and general role inclusion axioms. Also, it would
be very interesting to investigate means to give users, for a piece of information
they nd while exploring a model, an explanation of why the reasoner put this
information in the completion graph and, possibly, which other options there
were.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bauer</surname>
          </string-name>
          , J.:
          <article-title>Model Exploration to Support Understanding of Ontologies</article-title>
          . Diplomarbeit, Technische Universitat
          <string-name>
            <surname>Dresden</surname>
          </string-name>
          (
          <year>2009</year>
          )
          <article-title>Advisers-</article-title>
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lutz</surname>
          </string-name>
          , C.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nutt</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <source>Basic Description Logics. [21] chapter 2</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hustadt</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt</surname>
          </string-name>
          , R.:
          <article-title>Computational Modal Logic</article-title>
          . In Blackburn, P., van Benthem,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Wolter</surname>
          </string-name>
          , F., eds.: Handbook of Modal Logic.
          <source>Elsevier</source>
          (
          <year>2006</year>
          )
          <volume>181</volume>
          {
          <fpage>245</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          : Implementation and
          <string-name>
            <given-names>Optimisation</given-names>
            <surname>Techniques</surname>
          </string-name>
          .
          <source>[21] chapter 9</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Tsarkov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
          </string-name>
          , I.:
          <article-title>FaCT++ Description Logic Reasoner: System Description</article-title>
          .
          <source>In: Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006). Volume 4130 of Lecture Notes in Arti cial Intelligence</source>
          ., Springer (
          <year>2006</year>
          )
          <volume>292</volume>
          {
          <fpage>297</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Decidability of SHIQ with Complex Role Inclusion Axioms</article-title>
          .
          <source>In: Proc. of the 18th Int. Joint Conf. on Arti cial Intelligence (IJCAI</source>
          <year>2003</year>
          ), Morgan Kaufmann, Los Altos (
          <year>2003</year>
          )
          <volume>343</volume>
          {
          <fpage>348</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Decidability of SHIQ with Complex Role Inclusion Axioms</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>160</volume>
          (
          <issue>1</issue>
          {2) (
          <year>December 2004</year>
          )
          <volume>79</volume>
          {
          <fpage>104</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kutz</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>The Even More Irresistible SROIQ</article-title>
          .
          <source>In: Proc. of the 10th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR</source>
          <year>2006</year>
          ), AAAI Press (
          <year>2006</year>
          )
          <volume>57</volume>
          {
          <fpage>67</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>A tableau decision procedure for SHOIQ</article-title>
          .
          <source>J. of Automated Reasoning</source>
          <volume>39</volume>
          (
          <issue>3</issue>
          ) (
          <year>2007</year>
          )
          <volume>249</volume>
          {
          <fpage>276</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tobies</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Reasoning with Individuals for the Description Logic SHIQ</article-title>
          . In
          <string-name>
            <surname>McAllester</surname>
          </string-name>
          , D., ed.
          <source>: Proc. of the 17th Int. Conf. on Automated Deduction (CADE</source>
          <year>2000</year>
          ).
          <source>Volume 1831 of Lecture Notes in Computer Science</source>
          ., Springer (
          <year>2000</year>
          )
          <volume>482</volume>
          {
          <fpage>496</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shearer</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>A Hypertableau Calculus for SHIQ</article-title>
          .
          <source>In: Proc. of the 2007 Description Logic Workshop (DL</source>
          <year>2007</year>
          ). Volume 250 of CEUR (http://ceur-ws.
          <source>org/)</source>
          . (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kalyanpur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sirin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendler</surname>
          </string-name>
          , J.:
          <article-title>Swoop: A Web Ontology Editing Browser</article-title>
          .
          <source>Journal of Web Semantics</source>
          <volume>4</volume>
          (
          <year>2005</year>
          ) 2005
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Katifori</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Halatsis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lepouras</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vassilakis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giannopoulou</surname>
          </string-name>
          , E.:
          <article-title>Ontology visualization methods|a survey</article-title>
          .
          <source>ACM Comput. Surv</source>
          .
          <volume>39</volume>
          (
          <issue>4</issue>
          ) (
          <year>2007</year>
          )
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kalyanpur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Debugging and Repair of OWL Ontologies</article-title>
          .
          <source>PhD thesis</source>
          , University of Maryland at College Park, College Park, MD, USA (
          <year>2006</year>
          )
          <article-title>Adviser-James Hendler</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Barinskis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barzdins</surname>
          </string-name>
          , G.:
          <article-title>Satis ability Model Visualization Plugin for Deep Consistency Checking of OWL Ontologies</article-title>
          . In Golbreich,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Kalyanpur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Parsia</surname>
          </string-name>
          , B., eds.
          <source>: OWLED</source>
          . Volume
          <volume>258</volume>
          of CEUR Workshop Proceedings., CEUR-WS.org (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsia</surname>
            ,
            <given-names>B.:</given-names>
          </string-name>
          <article-title>Ontology Performance Pro ling and Model Examination: First Steps</article-title>
          . In Aberer,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.S.</given-names>
            ,
            <surname>Noy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Allemang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.I.</given-names>
            ,
            <surname>Nixon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.J.B.</given-names>
            ,
            <surname>Golbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Mika</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schreiber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Cudre-Mauroux</surname>
          </string-name>
          , P., eds.
          <source>: Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007)</source>
          , Busan, South Korea. Volume
          <volume>4825</volume>
          of LNCS., Berlin, Heidelberg, Springer Verlag (
          <year>November 2007</year>
          )
          <volume>589</volume>
          {
          <fpage>602</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Sirin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca-Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalyanpur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Katz</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Pellet: A Practical OWL-DL Reasoner</article-title>
          .
          <source>Journal of Web Semantics</source>
          <volume>5</volume>
          (
          <issue>2</issue>
          ) (
          <year>2007</year>
          )
          <volume>51</volume>
          {
          <fpage>53</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaplunova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Moller, R.:
          <source>Model Generation in Description Logics: What Can We Learn From Software Engineering? Technical report, Institute for Software Systems (STS)</source>
          , Hamburg University of Technology, Germany (
          <year>2007</year>
          ) See http://www.sts.tu-harburg.de/tech-reports/papers.html.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Shneiderman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Designing the User Interface: Strategies for E ective HumanComputer Interaction</article-title>
          .
          <string-name>
            <surname>Addison-Wesley Longman</surname>
          </string-name>
          Publishing Co., Inc., Boston, MA, USA (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Redish</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>A Practical Guide to Usability Testing</article-title>
          . Intellect Books, Exeter, UK (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel-Schneider</surname>
          </string-name>
          , P.F., eds.: The Description Logic Handbook: Theory, Implementation, and
          <string-name>
            <surname>Applications</surname>
          </string-name>
          . Cambridge University Press (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>