<!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>ORM2 Encoding into Description Logic (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Enrico Franconi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Mosca</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dmitry Solomakhin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Free University of Bozen-Bolzano</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Object Role Modelling (ORM2) is a conceptual modelling approach combining both textual specifications and graphical language, similar to UML and ER, and adopted by Visual Studio, the integrated development environment designed by Microsoft. This paper introduces a new linear syntax and corresponding complete set-theoretic semantics for a generalization of ORM2 language. A core fragment of ORM2 is defined, for which a provably correct encoding into ALCQI description logic is presented. Based on these results, an extensive and systematic critique of alternative approaches to the formalisation of ORM2 in (description) logics published so far is provided. A first prototype has been implemented, which o ers a back-end for the automated support of consistency and entailment checks for ORM2 conceptual schemas along with its translation into ALCQI knowledge bases.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Automated support to enterprise modelling has increasingly become a subject of
interest for organisations seeking solutions for storage, distribution and analysis of
knowledge about business processes [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and the main expectation from automated solutions
built upon these approaches is the ability to automatically determine consistency of a
business model. Despite existence of reasoning tools for Unified Modelling Language
(UML) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], its known weakness with regard to verbalisation of facts and constraints
restricts its usage by domain experts [10]. Recently becoming popular ORM2 (‘Object
Role Modelling 2’) is a graphical fact-oriented approach for modelling, transforming,
and querying business domain information, which allows for a verbalisation in
language readily understandable by non-technical users. Being domain expert oriented,
the semantics of ORM2 di ers from that of UML (e.g. permitting optionality of
cardinality constraints) and thus makes ORM2 richer in its capacity to express business
constraints [10].
      </p>
      <p>
        The NIAM language (‘Natural-language Information Analysis Method’), ancestor
ORM, has been equipped with an FOL-based semantics for the first time in 1989 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
Since then, despite the remarkable evolution in terms of expressivity and graphical
notation that ORM2 has experienced, much less attention has been paid in the consequent
development of appropriate formal foundations for the modelling language.
      </p>
      <p>
        This paper addresses the main problem of providing a logic formalism, equipped
with sound and complete reasoning services, that captures the expressiveness of ORM2.
The first contribution of the paper is thus the introduction of a completely new linear
syntax and a set-theoretic semantics for ORM2 matching the usage patterns in the
community. The new syntax can be used to express the full set of ORM2 graphical symbols
introduced in [10]. The second contribution of the paper is driven by a practical
objective. On the basis of well known results developed in the Description Logics (DLs)
community, we identified a ‘core’ fragment of ORM2 that can be translated in a sound
and complete way into the ExpTime-complete logic ALCQI [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], through n-ary
relations reification. On the basis of the results presented in the paper, a first prototype, built
on top of available DL reasoners, has been implemented, which provides an automated
support for schema consistency, entity/relations consistency check, and entailment
verification for user-defined ORM2 statements.
      </p>
      <p>The rest of the paper is organised as follows: Section 2 is about the introduction,
through examples, of the ORM2 graphical notation and intended semantics in the
framework of the fact modelling approach; Section 3 introduces the new linear syntax by
means of expressing the example from the previous section in this syntax. The
encoding of the corresponding set-theoretic semantics into the DL logic ALCQI is the main
topic of Section 4. Finally, Section 5 gives an overview of the implemented reasoning
support prototype, its interface and gives an example of its usage.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Fact-oriented Modelling in ORM2</title>
      <p>Basic ORM2 objects are: entities (e.g. a house or a car) and values (e.g. character
string or number). Moreover, entities and values are described in terms of the types
they belong to: a type (e.g. House, Car) is a set of possible instances. In order to avoid
ambiguity among the possible instances of a given type, entities are identified also by
means of a particular reference mode and a value. The roles played by the entities in a
given domain are introduced by means of logical predicates; each predicate (or
relation) has a given set of roles according to its arity. Each role is connected to exactly one
object type, indicating that the role is played only by possible instances of that type.</p>
      <p>The first step of the ORM2 design procedure thus concerns the specification of
the relevant object types (i.e. entity and value types), predicates and reference modes.
All the subsequent steps in the procedure mostly deal with the specification of static
constraints. Let us consider the example in Fig. 1:
As mentioned before, the modelling activity in ORM2 is supported by several tools that
provide user friendly graphical interfaces to build complex conceptual schemas.
However, none of the available design tools o ers automated reasoning support on specific
combinations of ORM2 constraints. The automated verification of schema consistency
and consistency of an object type over a conceptual schema strictly depends on the
possibility to perform reasoning and make inferences on it by means of a semantic-based
logic representation of the schema itself.</p>
      <p>
        With this goal in mind, we propose a linear syntax that fully covers the set of
graphical symbols of ORM2. Table 1, using the example from previous section, shows how
a new introduced syntax can be used to encode conceptual schemas that have been
originally specified in graphical terms. For each construct in the syntax, its
corresponding set-theoretic semantics expressed in relational algebra is also introduced in
table 2 (where O denotes an object type).
With the main aim of relying on available reasoning tools to reason in an e ective
way on ORM2 schemas, we present here the encoding in the logic ALCQI, for which
tableaux-based reasoning algorithms with a tractable computational complexity have
been developed [
        <xref ref-type="bibr" rid="ref8">8,12</xref>
        ]. The ALCQI encoding has been devised through an
intermediate translation step in the logic DLR, where arbitrary n-ary relations are allowed [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>g
tenh xam
)i2Ik)g
xa Ra
k:R
./:a=
1
kR
a
2:
./aR=
1:R
k
m
;
n
i
m
;gh
a
:
R
;
:</p>
      <p>I
k
R
m
:
a
en kR</p>
      <p>;
h 1:
t [ R
::: k:S
a )2 ./:b=
;
1
k</p>
      <p>S
tehn Ik)</p>
      <p>Sb :
)
;
g
a
k:
R</p>
      <p>?
n )=
teh Ik</p>
      <p>Sb
l
b
a
T
)
)g
1
f
[
N
(
N
(
) )
V %(
[ }
(E )
%
(
% }</p>
      <p>i
%:!CB;
( A;% cg</p>
      <p>C x
%h E;
)
)
% y b
( n u
} a S
r f
o =
) f
% .
( t
}( .s H
n d
n
a
o
b
l
a
) i
% t
r
a
(
}
( p
( a</p>
      <p>j
is :a</p>
      <p>R
H f
TE re =
2
)
a
:
R
(</p>
      <p>Rf bg
;mg k:
:a ;S
:
: 1
;
;::R k:b
: ;
;
n
1
b
:: k:
: S
;
;
:
:
:
;
R((f :b
c 1
xE ;S
T :
ES ::;1 I1</p>
      <p>R
(
- b
Rf 1:
I S</p>
      <p>A</p>
      <p>C
f %
(
) )) itc ,g
V %( je CB
[ } i %
(E
)
%
(
}
D
fg
e
R
;
m
y
S
;
c
il
c
y
c
A
;
m
y
s
it
s
n
a
r
T
;
rnA D2
;
t
In e
; m
:
:
;: 1:
:b I S
S 1
;f S(
g CB
m %
S )\
::: Ik
; R</p>
      <p>S</p>
      <p>:
b r1 Ii ;1
2: fo O1 O</p>
      <p>(f
./bS= IO n Si= I
a
s
Ii I
O O O
n n n
e e e
th th th
./:a=
1
a
2:
./aR=
1:R
a
k:R ;</p>
      <p>O O
g ;
n n
k :
R ::
;
O
;
1
O
(f
a
s
I
T
2 2 )2 j
) )</p>
      <p>2
g ;Ong &lt;i )
x
a
O m
;
:
:
:
;
1
O
(tof (x
T
T
;O 1
:
: y
:
;1 an
Of fro
E ?
T =
SE Ij</p>
      <p>O
E E
-S</p>
      <p>S
O O O
If If If Ii</p>
      <p>R
A</p>
      <p>C
\</p>
      <p>O
O If
;
n
i
m
(
=
)
O
(
D
,</p>
      <p>=
e I
fl V
e
r
,
c
i
(
2 Ii</p>
      <p>d
)
x
n</p>
      <p>=
a
m I
; O</p>
      <p>n
i e
m( th
=
)
R( )
D</p>
      <p>O
;
R
(</p>
      <p>J
R
A
C
:</p>
      <p>R
2 ;</p>
      <p>B
R O R t V
I I If an If
f f</p>
      <p>V
[
E g</p>
      <p>x
) E;
V to
[ T;
}(E Isa
f
=
H H
TE re
-S eh
O w
)
)g
1
f
1
f
[ ))
N g
(</p>
      <p>[
N( N(
)
[V N(
) m
[V %) ys
(E R (E %( Irr
D D
R R</p>
      <p>
        R
A
-C
ALCQI corresponds to the basic DL ALC equipped with qualified cardinality
restrictions and inverse roles, and it can also be viewed as a fragment of DLR [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] where
relations are restricted to be binary. The di culty implied by the absence of n-ary relations
has been overcome by means of reification. Unfortunately, apart from the necessity of
introducing reified relations, the restricted expressive power of ALCQI does not allow
to fully capture the semantics of the ORM2 constraints. The analysis of
corresponding limitations thus led to identification of a fragment of ORM2, called ORM2zero, that
is maximal with respect to the expressiveness of ALCQI, and that is still expressive
enough to capture the most frequent usage pattern of the modelling community [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>The ORM2zero fragment considers the following constraints:
ORM2zero = fTYPE; FREQ ; MAND; R-SET ; O-SETIsa; O-SETTot; O-SETEx; OBJg,
where: (i) FREQ can be applied to only one role at time, and (ii) R-SET applies
either to a pair of relations of the same arity or to two single roles. The encoding of the
semantics of ORM2zero is shown in table 3.</p>
      <p>Given the encoding above, a fragment of ALCQI KB corresponding to the schema
from the Fig. 1 is the following (where reified relations have been prefixed with ‘R-’):
Example 1:
9 (reportsTo.sub) :R-reportsTo v Admin
9 (reportsTo.obj) :R-reportsTo v AreaManager</p>
      <p>Admin v 9 (reportsTo.sub) :R-reportsTo
The correctness of the introduced encoding is guaranteed by the following theorem:
Theorem 1. Let zero be an ORM2zero conceptual schema and ALCQI the ALCQI
knowledge base constructed as described above. Then an entity/value type O is
consistent in zero if and only if the concept O is satisfiable w.r.t. ALCQI.</p>
    </sec>
    <sec id="sec-3">
      <title>Prototype of Automated Reasoning Support Tool</title>
      <p>The ORM2 automated reasoning support tool is implemented in Java and includes a
parser for ORM2 linear syntax, a set of Java classes representing the ORM2
knowledge database, a translator into an OWL2 ontology and a modal reasoning engine using
HermiT or FaCT++ as an underlying reasoner. The graphical user interface of a tool
is introduced on Figure 2 and contains controls which allow to select an input file,
underlying reasoner, output file and output format for resulting ontology (if needed). The
consistency check for an input ORM2 schema is performed after loading the input file
and the result of the check is communicated by visual flag as well as by a detailed log
in the corresponding window.
Let us now consider the following example in ORM2 linear syntax. This model
describes a domain of university personnel, which is partitioned into three mutually
exclusive categories: research sta , administration and some lazy people. We then introduce
an entity type Student as a part of university personnel, which is claimed to be neither
researchers nor administration sta .</p>
      <p>ENTITYTYPES: fUNI-Personnel,LazyPeople,Student,Admin,RTStaffg</p>
      <p>O-SETtot(fLazyPeople,RTStaff,Adming,UNI-Personnel)
O-SETex(fLazyPeople,RTStaff,Adming,UNI-Personnel)
O-SETisa(fStudentg,UNI-Personnel)
O-SETex(fStudent,RTStaffg,UNI-Personnel)</p>
      <p>O-SETex(fStudent,Adming,UNI-Personnel)
The resulting encoding in ALCQI will look like the following:</p>
      <p>UNI-Personnel v RTStaff t Admin t LazyPeople</p>
      <p>RTStaff v :Admin t :LazyPeople</p>
      <p>Admin v :LazyPeople
Student v :RTStaff t :Admin</p>
      <p>Student v UNI-Personnel
After loading the linear syntax input file, the corresponding conceptual schema is
automatically checked for consistency (see Figure 2). As a result of the consistency check
we obtain the message ’The given ORM2 schema is internally consistent’, which confirms
the correctness of the schema.</p>
      <p>Implemented entailment check functionality allows user to analyze the conceptual
schema and to discover interesting inferences. For example, let us analyze the entity
type Student, which is claimed to be part of the university personnel. However, since
the partition of UNI-Personnel described above is total, the only possibility for Student
to be non-empty is to be equivalent to the entity type LazyPeople. Which is indeed
confirmed by the inference engine of the implemented prototype when performing
entailment check for the following ORM2 statement (see Figure 2):</p>
      <p>O-SETisa(fStudentg,LazyPeople)
6</p>
    </sec>
    <sec id="sec-4">
      <title>Related Works</title>
      <p>
        In the last few years, several papers addressed the issue of encoding ORM2
conceptual schema into DL knowledge bases [15,14,13,11]. Among those proposals, [15] can
be taken as the only one going through the encoding with a formal perspective. In
particular, [15] pretends to start from the Halpin’s FOL semantics, and introduces an
encoding of a fragment of ORM2 into the logic DLRi f d [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In general, the paper
suffers from the presence of several imprecisions, redundancy, and syntactical mistakes
that makes the proposed mapping solutions not always clearly understandable.
Moreover, the bottom-up approach that avoids the specification of a complete theoretical
framework for the mapping of the ORM2 semantics into DLRi f d, makes some of these
solutions extremely questionable, such as in the case where ‘objectification’ is simply
treated as ‘relation reification’ in DL.
      </p>
      <p>As regards to [14], we mostly rely here on the extensive review already made by
Keet in [15]. Starting from this, it should be also noticed that subsequent attempts,
focused on the possibilities of encoding ORM2 into the the web ontology language
OWL2 [13,11], su er from the same formal inconsistencies and limitations of [14]. In
particular, [14] is misleading with respect to the underlying DL formalism: distinct DL
languages (e.g. DLR, plus DLR-Lite, plus SROIQ, plus ‘role composition’ operator)
are there arbitrary mixed together. No special semantics is provided by [14] in
correspondence with these combinations, nor theorems showing the complexity of reasoning
with them.</p>
      <p>
        Another paper focused on the encoding of ORM2 in OWL has also been recently
published [16]. The paper introduces a set of informal ‘rules’ devoted to the mapping of
a subset of ORM2 constructs into OWL Manchester Syntax [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Unfortunately, the paper
is misleading in several respects (for instance: (i) the OWL EquivalentTo, instead of
the SubClassOf, is erroneously introduced several times; (ii) optionality of uniqueness
constraints is definitively lost). In general, the paper covers a fragment that is smaller
than ORM2zero, and the proposed mapping mostly remains formally unjustified.
7
      </p>
    </sec>
    <sec id="sec-5">
      <title>Concluding Remarks</title>
      <p>In this paper we introduced a linear syntax and a complete set-theoretic semantics for
the ORM2 conceptual modelling language. A decidable, and computationally tractable,
fragment of ORM2 has been clearly identified and mapped into the DL logic ALCQI.
Finally, a first reasoning support prototype for ORM2 has been implemented, which
enables consistency and entailment checks for the defined fragment of ORM2. Future
theoretic works will be mainly focused on the extension of the ORM2zero towards the
identification of a more expressive, still decidable, ‘object role’ modelling language.
The practical objectives of the research will be directed towards full integration of
the prototype into third-party solutions providing graphical user interface for
designing ORM2 conceptual schemas (e.g. NORMA plugin for Microsoft Visual Studio). In
particular, such integration will benefit from reasoning capabilities of the tool by
providing the user with a list of all meaningful inferences entailed by the original schema.
10. Halpin, T., Morgan, T.: Information modeling and relational databases: from conceptual
analysis to logical design. Morgan Kaufmann, 2nd edn. (2001)
11. Hodrob, R., Jarrar, M.: ORM to OWL2 DL mapping. In: International conference on
intelligent semantic web: applications and services. ACM (2010)
12. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics.</p>
      <p>In: Proceedings of the 6th International Conference on Logic Programming and
Automated Reasoning. pp. 161–180. LPAR ’99, Springer-Verlag, London, UK (1999), http:
//dl.acm.org/citation.cfm?id=645709.664314
13. Jarrar, M.: Mapping ORM into the SHOIN/OWL description logic – towards a
methodological and expressive graphical notation for ontology engineering. In: OTM 2007 workshops:
Proceedings of the International Workshop on Object-Role Modeling (ORM’07). LNCS, vol.
4805, pp. 729–741. Springer (November 2007)
14. Jarrar, M.: Towards automated reasoning on ORM schemes. mapping ORM into the DLRi f d
description logic. In: Proceedings of the 26th International Conference on Conceptual
Modeling (ER 2007). LNCS, vol. 4801, pp. 181–197. Springer (November 2007)
15. Keet, M.: Mapping the Object-Role Modeling language ORM2 into description logic
language DLRi f d. Tech. Rep. KRDB07-2, KRDB Research Centre, Faculty of Computer
Science, Free University of Bozen-Bolzano (2007)
16. Wagih, H.M., ElZanfaly, D.S., Kouta, M.M.: Mapping Object Role Modeling 2 schemes to
OWL2 ontologies. In: Ting, Z. (ed.) Proceedings of the 3rd IEEE International Conference
on Computer Research and Development (ICCRD), Shanghai, China, March 11-13, 2011.
vol. 4, pp. 126–132. IEEE Press (2011)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>
            ,
            <given-names>P.F</given-names>
          </string-name>
          . (eds.):
          <article-title>The description logic handbook: theory, implementation, and applications</article-title>
          . Cambridge University Press, New York, NY, USA (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Berardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cali</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giacomo</surname>
            ,
            <given-names>G.D.:</given-names>
          </string-name>
          <article-title>Reasoning on UML class diagrams</article-title>
          .
          <source>Artificial intelligence 168</source>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Giacomo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Identification constraints and functional dependencies in description logics</article-title>
          .
          <source>In: Proceedings of the 17th international joint conference on Artificial intelligence -</source>
          Volume
          <volume>1</volume>
          . pp.
          <fpage>155</fpage>
          -
          <lpage>160</lpage>
          . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (
          <year>2001</year>
          ), http://dl.acm.org/citation.cfm?id=
          <volume>1642090</volume>
          .
          <fpage>1642111</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Giacomo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosati</surname>
          </string-name>
          , R.:
          <article-title>Description logic framework for information integration</article-title>
          .
          <source>In: Proc. of the 6th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'98)</source>
          . pp.
          <fpage>2</fpage>
          -
          <lpage>13</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Description logics for conceptual data modeling</article-title>
          . In: Chomicki,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Saake</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (eds.)
          <source>Logics for Databases and Information Systems</source>
          . pp.
          <fpage>229</fpage>
          -
          <lpage>263</lpage>
          . Kluwer (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ceravolo</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fugazza</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leida</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Modeling semantics of business rules</article-title>
          .
          <source>In: Proceedings of the Inaugural IEEE International Conference On Digital Ecosystems</source>
          and
          <string-name>
            <surname>Technologies (IEEE-DEST)</surname>
          </string-name>
          (
          <year>February 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Grau</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shankey</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wallace</surname>
          </string-name>
          , E. (eds.):
          <source>Proceedings of the OWLED*06 Workshop on OWL: Experiences and Directions</source>
          , Athens, Georgia, USA, November
          <volume>10</volume>
          -
          <issue>11</issue>
          ,
          <year>2006</year>
          , CEUR Workshop Proceedings, vol.
          <volume>216</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Haarslev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mller</surname>
          </string-name>
          , R.:
          <article-title>Expressive ABox reasoning with number restrictions, role hierarchies, and transitively closed roles</article-title>
          .
          <source>In: KR'00</source>
          . pp.
          <fpage>273</fpage>
          -
          <lpage>284</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Halpin</surname>
          </string-name>
          , T.:
          <article-title>A logical analysis of information systems: static aspects of the data-oriented perspective</article-title>
          .
          <source>PhD thesis</source>
          , Department of Computer Science, University of Queensland (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>