<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Brasilia, Brazil
EMAIL: christian.kindermann@stanford.edu (C. Kindermann); martige@ifi.uio.no (M. G. Skjaeveland)
ORCID:</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Concrete Names for Complex Expressions in Ontologies: A Survey of Biomedical Ontologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Christian Kindermann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martin Georg Skjaeveland</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Stanford University</institution>
          ,
          <addr-line>450 Serra Mall, Stanford</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Oslo</institution>
          ,
          <addr-line>Problemveien 7, 0315 Oslo</addr-line>
          ,
          <country country="NO">Norway</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>The representation of an entity in an ontology may require complex expressions to capture all of its relevant characteristics. If an entity can be defined based on its characteristics, then its definition can be explicitly stated in most knowledge representation languages, such as the Web Ontology Language (OWL). Specifically, a domain-specific entity can be identified by a name in an ontology, which can be declared to be logically equivalent to a more complex expression This not only fixes the meaning of the entity in the ontology but also allows its name to replace the more complex expression throughout the ontology. Consistently using concise and informative names for domain-specific entities in an ontology can arguably enhance ontology comprehension, maintenance, and usability in practice. This raises the question of the extent to which entities represented in ontologies are associated with concrete names and how such names are used. In this paper, we analyze how often named classes in OWL ontologies are defined as logically equivalent to complex expressions. We investigate whether such named classes are consistently used whenever possible and whether they are associated with labels intended for human understanding. Our ifndings indicate that complex class expressions are frequently declared to be equivalent to named classes in ontologies, and that such named classes are linked to human readable labels. While there seems to be a tendency to encourage the reuse of these names, we also observe a notable number of instances where such named classes are not consistently reused despite being defined.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Ontology Engineering</kwd>
        <kwd>Biomedical Ontology</kwd>
        <kwd>Web Ontology Language</kwd>
        <kwd>OWL</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The representation of an entity in an ontology typically involves statements about the entity’s
characteristics. When an entity can be defined based on its characteristics, the definition may
include an informative name by which the entity can be referred to. Specifically, an entity’s
name may be used instead of its more complex definitional description. Despite the potential
benefits of consistently using concise and informative names whenever possible, it has been
observed that this practice is not always followed in published ontologies. To illustrate this, we
revisit a concrete example taken from the Galen ontology, which was originally presented by
Nikitina and Koopmann [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Here, the medical concept Clotting is represented as follows:
      </p>
      <sec id="sec-1-1">
        <title>Clotting ≡ ∃</title>
        <p>actsSpecificallyOn.(Blood</p>
        <p>⊓ ∃ hasPhysicalState.(PhysicalState ⊓ ∃ hasState.Liquid))
⊓ ∃ hasOutcome.SolidBlood</p>
        <p>This axiom is arguably complex due to both its size and the nesting of expressions. However,
Galen also contains the following axioms:</p>
      </sec>
      <sec id="sec-1-2">
        <title>LiquidBlood ≡ Blood ⊓ ∃ hasPhysicalState.LiquidState</title>
      </sec>
      <sec id="sec-1-3">
        <title>LiquidState ≡ PhysicalState ⊓ ∃ hasState.Liquid</title>
        <p>Given these equivalences, the named concept LiquidBlood can be used to simplify the
representation of Clotting to</p>
      </sec>
      <sec id="sec-1-4">
        <title>Clotting ≡ ∃</title>
        <p>actsSpecificallyOn.LiquidBlood
⊓ ∃ hasOutcome.SolidBlood</p>
        <p>The latter representation of Clotting is arguably easier to read, comprehend, and maintain.
This observation raises questions about the frequency of defining concrete names for complex
expressions, the consistency of using such names throughout an ontology, and to what extent the
use of names simplifies the definition of more complex concepts. The contributions presented in
this paper are as follows: (i) we propose an approach for identifying named classes with logical
definitions in ontologies, (ii) we develop techniques for quantifying the use and lack of reuse of
such named classes, and (iii) we use these techniques to conduct an empirical investigation on a
large and complex corpus of ontologies in the biomedical domain to shed light on the use of
such names in real-world ontologies.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries</title>
      <p>
        We assume the reader to be familiar with OWL [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and only fix some terminology. Let  ,  ,
and  be sets of class names, individual names, and property names. A class is either a class
name or a complex class built using OWL class constructors. We will use ⊤ and ⊥ to denote
owl:Thing and owl:Nothing respectively. We use both OWL Functional Style Syntax [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and
Manchester Syntax [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to write OWL axioms. An ontology is a set of axioms and we write
 |=  to denote that the ontology  entails the axiom  . An axiom  is explicit in  if
 ∈ , and implicit if  ̸∈  but  |=  . An OWL expression  occurs in  if  is used as a
subexpression within an explicit axiom in .
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Abbreviations in Ontologies</title>
      <p>
        The Oxford English Dictionary defines the word abbreviation to denote “[t]he result of shortening
something; an abbreviated or condensed form, esp. of a text; a summary, an abridgement” [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
So, we define an abbreviation for a complex OWL expression in terms of an equivalent named
class. More formally, let A be a named class and C be a complex class expression. Then A is an
 1 = SpicyPizza EquivalentTo Pizza and
      </p>
      <p>(hasTopping some (PizzaTopping and (hasSpiciness some Hot)))
 2 = SpicyTopping EquivalentTo PizzaTopping and (hasSpiciness some Hot)
 3 = SpicyTopping EquivalentTo HotTopping
 4 = DiavolaPizza SubClassOf SpicyPizza
 5 = DiavolaPizza SubClassOf Pizza and hasCountryOfOrigin value Italy
 6 = NapoletanaPizza SubClassOf Pizza and hasCountryOfOrigin value Italy
abbreviation for C in an ontology , if  |= EquivalentClasses (A, C). We will refer to the
EquivalentClasses axiom as the definition of the abbreviation A.</p>
      <p>A complex OWL expression can be equivalent to more than just one named class. We refer
to equivalent named classes as synonyms.1 In particular, a synonym for a named class N in
an ontology  is a named class S s.t.  |= EquivalentClasses (S, N) and we will refer to the
EquivalentClasses axiom as the synonym’s definition. Please note that synonyms are not
necessarily abbreviations. However, a synonym for an abbreviation is also an abbreviation (due
to transitivity of EquivalentClasses ).</p>
      <p>Both abbreviations and synonyms are notions based on entailment, i.e., an EquivalentClasses
axiom with exactly two arguments. However, OWL specifies EquivalentClasses as an -ary
constructor. So, for the purpose of analyzing how abbreviations and synonyms are
specified in ontologies, we introduce the notion syntactic definitions types for both
abbreviations and synonyms. In particular, an axiom of the form EquivalentClasses (A, C) and
EquivalentClasses (S, A) will be referred to as simple definitions for the abbreviation A and
the synonym S respectively. An axiom of the form EquivalentClasses (A, C1, . . . , C) where
C1, . . . C are complex class expressions is a ambiguous definition of A. An axiom of the form
EquivalentClasses (S1, . . . , S) is an enumerative definition for the synonyms S1, . . . , S.
And lastly, an axiom of the form EquivalentClasses (S1, . . . , S, C1, . . . , C) will be referred
to as a compound definition for S1, . . . , S, which are both synonyms and abbreviations.</p>
      <p>
        With this notion of definition types, we can quantify how abbreviations and synonyms are
specified explicitly in an ontology. However, counting implicit definitions of abbreviations
and synonyms is not as straightforward, as extracting nfiite sets of entailments is a non-trivial
matter [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. We will delve into the determination and counting of implicit abbreviations and
synonyms in more detail in Section 4. Before that, though, we address the more obvious question
of how abbreviations and synonyms are used in an ontology.
      </p>
      <p>
        Consider the example ontology  shown in Figure 1. Here, the abbreviation SpicyPizza is
specified via a simple definition in axiom  1 and occurs on the right-hand side of  4. So, we say
an abbreviation is used if it occurs in an OWL axiom that is not its definition. In addition to
the use of an abbreviation, we can also determine if an abbreviation is not used even though its
use would be possible. We refer to such a case as an abbreviation’s possible use. For example,
1The Oxford English Dictionary defines the word synonym to denote “Strictly, a word having the same sense as
another (in the same language); [. . .]” [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
consider axiom  1 ∈ . Here, the abbreviation SpicyTopping (and its synonym HotTopping)
has possible uses since the complex OWL expression PizzaTopping and (hasSpiciness some Hot)
could be replaced by either SpicyTopping or HotTopping.
      </p>
      <p>With the notions of an abbreviation’s use and possible use, we can quantify the impact of
abbreviations in an ontology. Before we do so, we come back to the topic of determining both
explicit and implicit definitions of abbreviation and synonyms in an ontology.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Determining Abbreviations and Synonyms</title>
      <p>Explicit definitions for abbreviations can be easily determined by checking the syntactic shape
of all axioms in a given ontology. Similarly, implicit definitions can be determined by checking
 |= EquivalentClasses (A, C) for all pairs of named classes and complex classes occurring in
an ontology. However, this becomes impractical for large ontologies with numerous named and
complex classes.</p>
      <p>
        Instead, to determine implicit abbreviations, we build upon highly optimized implementations
of the standard reasoning service classification , i.e., computing all entailed SubClassOf and
EquivalentClasses axioms between named classes in an ontology [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8, 9, 10</xref>
        ]. We will refer to
this set as the inferred class hierarchy (ICH). The idea is to introduce an abbreviation for every
complex class expressions that occurs in a given ontology, then to compute the ICH of the
ontology with these newly added abbreviations, and finally to read of all implicit abbreviations
from the ICH.
      </p>
      <p>More formally, for a given ontology , we create the abbreviation ontology</p>
      <p>=  ∪ {EquivalentClasses (A, C) | C occurs in , A does not occur in }
and compute ICH(). Since the ICH captures all SubClassOf and EquivalentClasses
relationships between named classes in an ontology, it is straightforward to identify all named
classes in  that are equivalent to a newly introduced abbreviation A in .</p>
      <p>We will demonstrate this procedure by way of example. Consider the ontology  shown
in Figure 1. This ontology contains complex class expressions C1, . . . , C6 as shown in Figure 2a.
Classifying the abbreviation ontology  and inspecting the ICH (see Figure 2) reveals that,
for example, SpicyTopping is equivalent to A2, which in turn is equivalent to C2 by construction.
So, SpicyTopping is an abbreviation for C2 in .</p>
    </sec>
    <sec id="sec-5">
      <title>5. Study Design and Materials</title>
      <p>Before we investigate to what extent abbreviations and synonyms are defined, used, and not
used even though this would be possible, we first establish a baseline. This baseline aims to
determine whether named classes in ontologies are associated with concrete domain-specific
terms that are intended for human interpretation. Specifically, we assess the association of
named classes in ontologies with human-readable annotations specified via rdfs:label2 and
obo:definition.3 Similarly, we establish a baseline for human-readable synonyms specified
2https://www.w3.org/TR/rdf-schema/#ch_label
3http://purl.obolibrary.org/obo/IAO_0000115
C1 = hasSpiciness some Hot
C2 = PizzaTopping and (hasSpiciness some Hot)
C3 = hasTopping some (PizzaTopping and (hasSpiciness some Hot))
C4 = Pizza and (hasTopping some (PizzaTopping and (hasSpiciness some Hot)))
C5 = hasCountryOfOrigin value Italy
C6 = Pizza and hasCountryOfOrigin value Italy
(a) Complex class expressions in .</p>
      <p>⊤
Hot</p>
      <p>A3</p>
      <p>Pizza</p>
      <p>A5</p>
      <p>PizzaTopping</p>
      <p>A1
SpicyPizza, A4</p>
      <p>A6</p>
      <p>HotTopping, SpicyTopping, A2
DiavolaPizza</p>
      <p>NapoletanaPizza
(b) Visualisation of ICH() without ⊥.
via skos:altLabel,4 oio:hasExactSynonym, oio:hasNarrowSynonym, oio:hasBroadSynonym,
oio:hasRelatedSynonym,5 or obo:alternativeLabel.6</p>
      <p>
        We conduct our empirical investigation using ontologies indexed in BioPortal as of February
2023.7 The data set is created folllowing the same approach as described by Matentzoglu and
Parsia [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and includes a total of 785 ontologies. For orchestrating the empirical investigation,
we use use the OWL API (v.5.1.15). We exclude ontologies that cannot be processed with the
OWL API. Additionally, we exclude ontologies that do not contain any class expression axioms
since such ontologies cannot contain abbreviations or synonyms. As a result of this procedure,
our study corpus consists of 744 ontologies.
      </p>
      <p>We group ontologies into three disjoint categories. First, ontologies that consist of atomic
axioms only, i.e., SubClassOf and EquivalentClasses axioms that have only named classes
as arguments. Second, ontologies expressible in ℰ ℒ++, and third, ontologies not expressible
in ℰ ℒ++. We refer to these three kinds of ontologies as atomic, ℰ ℒ++, and rich ontologies
4https://www.w3.org/2012/09/odrl/semantic/draft/doco/skos_altLabel.html
5https://raw.githubusercontent.com/geneontology/go-ontology/master/contrib/oboInOwl#{hasExactSynonym,
hasNarrowSynonym, hasBroadSynonym, hasRelatedSynonym}.
6http://purl.obolibrary.org/obo/IAO_0000118
7https://bioportal.bioontology.org/</p>
      <sec id="sec-5-1">
        <title>Ontology indices (grouped by category and ordered by TBox size)</title>
        <p>respectively. The study corpus contains 91 atomic ontologies, 88 ℰ ℒ++ ontologies, and 565 rich
ontologies. We order ontologies within a category by the size of their TBoxes and assign each
ontology an index in ascending order starting with atomic ontologies, then ℰ ℒ++ ontologies,
and finally rich ontologies. Figure 3 illustrates this indexing by showing a comparison between
the size of an ontology’s (a) TBox and (b) the subset of class expression axioms.</p>
        <p>Using the reasoner Konclude (v0.7.0-1138), we successfully classified 714 ontologies (for the
purpose of determining implicit synonyms) and 656 abbreviation ontologies (for the purpose of
determining implicit abbreviations).</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Results</title>
      <p>Before presenting our results on abbreviations and synonyms (see Section 3) we report on the
use of annotation properties for specifying human-readable labels, definitions, and synonyms.
Table 1 illustrates the number of ontologies that ofer human-readable annotations for varying
percentages of named classes.</p>
      <p>We find that rdfs:labels are available in many ontologies for large proportions of named
classes. For instance, 51 + 51 + 232 = 334 ontologies provide rdfs:labels for all named classes.
An additional 19 + 16 + 130 = 165 ontologies provide rdfs:labels for at least 90% of named
classes (but not 100%), so that (334 + 165)/744 ≈ 67% of ontologies provide rdfs:labels for at
least 90% of named classes. This provides strong evidence of the importance of human-readable
rdfs:labels for named classes representing domain-specific concepts in biomedical ontologies.</p>
      <p>We also find that obo:definitions are used in many ontologies. For example, 226 ontologies,
i.e., 226/744 ≈ 30%, provide obo:definitions for at least half of all named classes. While these
proportions are smaller compared to rdfs:labels, they are non-trivial and provide evidence
that obo:definitions play an important role in many biomedical ontologies.</p>
      <p>However, human-readable annotations for synonyms appear to be less common in biomedical
ontologies compared to rdfs:labels and obo:definitions. While there are a few ontologies
1 × 106
sm100000
o
ixA 10000
fo 1000
reb 100
um 10
N 1</p>
      <p>100 200 300 400 500 600 700</p>
      <sec id="sec-6-1">
        <title>Ontology indices (grouped by category and ordered by size)</title>
        <p>that annotate more than 90% of named classes with synonyms, e.g., 12 in the case of skos:alt,
a lot of ontologies do not provide such synonym annotations for named classes at all (see
last row in Table 1). This suggests that although annotations for synonyms are used in some
biomedical ontologies, they do not seem to hold the same level of importance as rdfs:labels
and obo:definitions for the most part.</p>
        <p>The last observation can also be made w.r.t. the logical notions of abbreviations and
synonyms. Figure 4 shows how many EquivalentClassesAxioms are syntactic definition types for
abbreviations or synonyms (see Section 3 for definition types). It becomes evident that there
are about twice as many ontologies in which abbreviations are (explicitly) defined compared
with ontologies in which synonyms are (explicitly) defined — namely 309 and 136 respectively.
We also note that abbreviations and synonyms are specified only via simple definitions.</p>
        <p>The diference between abbreviations and synonyms is not only evident in the number of
ontologies in which they are defined but also in the number of definitions within ontologies.
We find that the definitions for abbreviations are more numerous compared to definitions for
synonyms. Specifically, there are 105 ontologies that define more than a hundred abbreviations,
whereas only eight ontologies have more than a hundred definitions for synonyms. Given these
observations, we will focus on abbreviations rather than synonyms in the remainder of this
paper and will start with a discussion of explicitly defined abbreviations and then proceed with
implicitly defined ones.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Ontology indices (grouped by category and ordered by size)</title>
        <p>(a) Explicitly defined abbreviations.</p>
      </sec>
      <sec id="sec-6-3">
        <title>Ontology indices (grouped by category and ordered by size)</title>
        <p>(b) Implicitly defined abbreviations.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Related Work</title>
      <p>
        Logical equivalent rewritings for ontologies are usually motivated for the purpose of improved
reasoning performance [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] or ontology-based data access [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. However, the idea of rewriting
axioms to improve ontology comprehension has also been discussed. Existing work in this
direction focuses on rewritings that are minimal in size because large expressions are arguably
hard to read and comprehend [
        <xref ref-type="bibr" rid="ref1 ref14 ref15">14, 15, 1</xref>
        ]. Yet, it is debatable whether the smallest possible logical
rewriting of an axiom is indeed most suitable for human interpretation.
      </p>
      <p>In the work presented in this paper, the focus is not on rewritings that are minimal in size.
Rather, we study to what extent domain-specific vocabulary defined in an ontology can be
reused to simplify otherwise complex expressions. The main argument being that a meaningful</p>
      <sec id="sec-7-1">
        <title>Ontology indices (grouped by category and ordered by size)</title>
        <p>name is more readily understood by domain experts compared to more complex expressions in
OWL. It is important to note that the associated reduction in size is secondary in this context.</p>
        <p>
          The task of determining abbreviations in an ontology (cf. Section 4) can be interpreted as
concept definability, i.e., the problem of finding a definition for a concept name in an ontology [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
However, we restrict the problem to finding definitions for concepts in terms of complex class
expressions that already occur, syntactically speaking, in an ontology. Nevertheless, advances
in research on concept definability may provide useful insights, e.g., knowing under what
conditions implicitly defined concepts can also be defined explicitly.
        </p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>8. Discussion &amp; Future Work</title>
      <p>
        The OBO Foundry considers naming conventions important for ontology comprehension,
readability, navigability, alignment, and integration [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and recommends that the majority of
classes in an ontology should have textual definitions [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. While not all biomedical ontologies
conform to the principles put forward by the OBO Foundry, there is no question that
humanreadable names and definitions are used in many ontologies (see Table 1 in Section 6).
      </p>
      <p>The use of human-readable names is important, because technical terms in a domain-specific
vocabulary tend to be defined in terms of already defined terms. For example, a ’blood assay
datum’ is defined as ’A data item that is the specified output of a blood assay’. This definition
only makes sense if the notion of a ’blood assay’ is already defined. So, if textual definitions
make use of already defined terms, and textual definitions should match logical definitions, as
the OBO Foundry advocates, then possible uses of explicitly defined abbreviations (cf. Section 3)
should not occur.8</p>
      <p>However, our results suggest that even though the reuse of already defined concepts seems
to be preferred, there is a non-trivial number of cases in which a complex class expression
could be replaced by an existing equivalent named class. It would be interesting to consult with
the ontology developers in such cases to determine whether such cases are intended or not.
Likewise, it would be interesting to find out whether classes with implicit logical definitions are
intentional and should be made explicit, and whether they should be reused whenever possible.</p>
      <p>In addition to the question of when to use an abbreviation, is the question of when to introduce
a new abbreviation. In particular, if a complex class expression occurs often in an ontology,
one may want to think about whether such an expression can be given a meaningful name and
which should be used instead.</p>
      <p>However, it needs to be highlighted that the introduction of an abbreviation, as defined in
this work, changes the meaning of an ontology. Consider the ontology  and  =  ∪ { }
where  = EquivalentClasses (A, C) is a definition for an abbreviation A. If A does not occur
in , then  ̸≡   because  |=  but  ̸|=  . This change in meaning can be avoided by
encoding abbreviations using a meta-language, e.g., OTTR [19], on top of OWL. As an example,
consider the ontology
 = {</p>
      <p>Napoletana
Diavola
Hawaiian</p>
      <p>SubClassOf Pizza and hasCountryOfOrigin value Italy,
SubClassOf Pizza and hasCountryOfOrigin value Italy,</p>
      <p>SubClassOf Pizza and hasCountryOfOrigin value Canada</p>
      <sec id="sec-8-1">
        <title>With OTTR, a mapping ItalianPizza ↦→ Pizza and hasCountryOfOrigin value Italy can be</title>
        <p>defined, so that  can be encoded as
 = {</p>
        <p>Napoletana
Diavola
Hawaiian</p>
        <p>SubClassOf ItalianPizza,
SubClassOf ItalianPizza,</p>
        <p>SubClassOf Pizza and hasCountryOfOrigin value Canada
Note that ItalianPizza is not an OWL class but an expression in OTTR. In particular, the
ontology  is semantically equivalent to  because the OTTR expression ItalianPizza
is indistinguishable from Pizza and hasCountryOfOrigin value Italy on the level of OWL.
The use of a meta-level language also opens up possibilities to capture definitions on higher
level of abstraction than OWL. In the case of the example ontology , the
representation of a pizza’s country of origin could be captured by a parameterized OTTR expression</p>
      </sec>
      <sec id="sec-8-2">
        <title>PizzaWithOrigin() ↦→ Pizza and hasCountryOfOrigin value . With this, all three pizzas</title>
        <p>in  can be encoded in a uniform manner giving rise to the following even more meaningful
definitions:
}.
}.
 = {</p>
        <p>Napoletana
Diavola
Hawaiian</p>
        <p>SubClassOf PizzaWithOrigin(Italy),
SubClassOf PizzaWithOrigin(Italy),
SubClassOf PizzaWithOrigin(Canada)
}.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>9. Conclusion</title>
      <p>In this paper, we proposed an approach for analyzing and quantifying the use of logical
abbreviations, i.e., named classes that are defined to be logically equivalent to complex class expressions.
We used this approach to survey biomedical ontologies indexed in BioPortal and find that
abbreviations are highly prevalent. Although there are some exceptions, explicitly defined
abbreviations tend to be used whenever possible. However, implicitly defined abbreviations
often come with many possible uses which rasies the question of whether this is intentional or
undesireable.
data principles to evaluate ontologies, Database J. Biol. Databases Curation 2021 (2021). URL:
https://doi.org/10.1093/database/baab069. doi:10.1093/database/baab069.
[19] M. G. Skjaeveland, D. P. Lupp, L. H. Karlsen, H. Forssell, Practical Ontology Pattern Instantiation,
Discovery, and Maintenance with Reasonable Ontology Templates, in: ISWC (1), volume 11136 of
Lecture Notes in Computer Science, Springer, 2018, pp. 477–494.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Nikitina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Koopmann</surname>
          </string-name>
          , Small Is Beautiful:
          <article-title>Computing Minimal Equivalent EL Concepts</article-title>
          ,
          <source>in: AAAI</source>
          , AAAI Press,
          <year>2017</year>
          , pp.
          <fpage>1206</fpage>
          -
          <lpage>1212</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Cuenca Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Motik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <string-name>
            <surname>U.</surname>
          </string-name>
          <article-title>Sattler, OWL 2: The next step for OWL</article-title>
          ,
          <source>Journal of Web Semantics</source>
          <volume>6</volume>
          (
          <year>2008</year>
          )
          <fpage>309</fpage>
          -
          <lpage>322</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Motik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , OWL 2 Web
          <string-name>
            <given-names>Ontology</given-names>
            <surname>Language. Structural Specification</surname>
          </string-name>
          and
          <string-name>
            <surname>Functional-Style Syntax (Second Edition)</surname>
          </string-name>
          (
          <year>2012</year>
          ). URL: http://www.w3.org/TR/owl2-syntax/.
        </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>P.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          , OWL 2
          <string-name>
            <given-names>Web</given-names>
            <surname>Ontology Language Manchester Syntax (Second Edition)</surname>
          </string-name>
          (
          <year>2012</year>
          ). URL: https://www.w3.org/TR/owl2-manchester-syntax/.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5] abbreviation, n.,
          <source>in: OED Online</source>
          , Oxford University Press,
          <year>2022</year>
          . URL: https://www.oed.com/view/ Entry/180?redirectedFrom=abbreviation&amp;,
          <source>accessed July 05</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6] synonym, n.,
          <source>in: OED Online</source>
          , Oxford University Press,
          <year>2022</year>
          . URL: https://www.oed.com/view/ Entry/196522?result=1&amp;rskey=EVWsim&amp;,
          <source>accessed July 05</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bail</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , U. Sattler,
          <article-title>Extracting Finite Sets of Entailments from OWL Ontologies</article-title>
          , in: Description Logics, volume
          <volume>745</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hollunder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Nebel</surname>
          </string-name>
          , H.
          <string-name>
            <surname>Profitlich</surname>
            ,
            <given-names>E. Franconi,</given-names>
          </string-name>
          <article-title>An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move on</article-title>
          , in: KR, Morgan Kaufmann,
          <year>1992</year>
          , pp.
          <fpage>270</fpage>
          -
          <lpage>281</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Glimm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Motik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. D. C.</given-names>
            <surname>Shearer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Stoilos</surname>
          </string-name>
          ,
          <article-title>A novel approach to ontology classification</article-title>
          ,
          <source>J. Web Semant</source>
          .
          <volume>14</volume>
          (
          <year>2012</year>
          )
          <fpage>84</fpage>
          -
          <lpage>101</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kazakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krötzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Simancik</surname>
          </string-name>
          ,
          <article-title>The Incredible ELK - From Polynomial Procedures to Eficient Reasoning with ℰ ℒ Ontologies</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Autom</surname>
          </string-name>
          . Reason.
          <volume>53</volume>
          (
          <year>2014</year>
          )
          <fpage>1</fpage>
          -
          <lpage>61</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Matentzoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          ,
          <source>BioPortal Snapshot 30.03</source>
          .
          <year>2017</year>
          ,
          <year>2017</year>
          . URL: https://doi.org/10.5281/zenodo. 439510. doi:
          <volume>10</volume>
          .5281/zenodo.439510.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Carral</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Feier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. Horrocks</given-names>
            ,
            <surname>EL-ifying</surname>
          </string-name>
          <string-name>
            <surname>Ontologies</surname>
          </string-name>
          , in: IJCAR, volume
          <volume>8562</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2014</year>
          , pp.
          <fpage>464</fpage>
          -
          <lpage>479</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Imprialou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Stoilos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <article-title>Benchmarking Ontology-Based Query Rewriting Systems</article-title>
          , in: AAAI, AAAI Press,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Küsters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Molitor</surname>
          </string-name>
          ,
          <article-title>Rewriting Concepts Using Terminologies</article-title>
          , in: KR, Morgan Kaufmann,
          <year>2000</year>
          , pp.
          <fpage>297</fpage>
          -
          <lpage>308</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Horridge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          , U. Sattler,
          <article-title>Laconic and Precise Justifications in OWL</article-title>
          , in: ISWC, volume
          <volume>5318</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2008</year>
          , pp.
          <fpage>323</fpage>
          -
          <lpage>338</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>B.</given-names>
            <surname>ten Cate</surname>
          </string-name>
          , E. Franconi,
          <string-name>
            <surname>I. Seylan</surname>
          </string-name>
          , Beth Definability in Expressive Description Logics,
          <string-name>
            <given-names>J.</given-names>
            <surname>Artif</surname>
          </string-name>
          .
          <source>Intell. Res</source>
          .
          <volume>48</volume>
          (
          <year>2013</year>
          )
          <fpage>347</fpage>
          -
          <lpage>414</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Schober</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kusnierczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lomax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mungall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. F.</given-names>
            <surname>Taylor</surname>
          </string-name>
          , P. RoccaSerra, S. Sansone,
          <article-title>Survey-based naming conventions for use in OBO Foundry ontology development</article-title>
          ,
          <source>BMC Bioinform</source>
          .
          <volume>10</volume>
          (
          <year>2009</year>
          ). URL: https://doi.org/10.1186/
          <fpage>1471</fpage>
          -2105-10-
          <lpage>125</lpage>
          . doi:
          <volume>10</volume>
          .1186/
          <fpage>1471</fpage>
          -2105-10-125.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R. C</given-names>
            .
            <surname>Jackson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Matentzoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Overton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Vita</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Balhof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. L.</given-names>
            <surname>Buttigieg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Carbon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Courtot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Diehl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Dooley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. D.</given-names>
            <surname>Duncan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. L.</given-names>
            <surname>Harris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Haendel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Natale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Osumi-Sutherland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruttenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Schriml</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J. S.</given-names>
            <surname>Jr.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Vasilevsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Walls</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Mungall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Peters</surname>
          </string-name>
          , OBO Foundry in
          <year>2021</year>
          : operationalizing open
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>