<!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>Natural Language Template Selection for Temporal Constraints</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>C. Maria KEET</string-name>
          <email>mkeet@cs.uct.ac.za</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Cape Town</institution>
          ,
          <country country="ZA">South Africa</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Representing temporal knowledge and information in temporal logics for ontologies and conceptual data models has faced issues due to inaccessibility of the underlying logic and limited intuitiveness of diagrammatic extensions to the modelling languages. We aim to address this by designing controlled natural language templates for generating sentences that verbalise in English the temporal constraints de ned in a temporal logic. We devised 101 templates, which were evaluated by experts in temporal logics and by novice temporal modellers on semantic adequacy and preference. There was only 12% unanimity among the experts, and 89% by majority voting. The novice temporal modellers were much more lenient in judgment on whether the templates captured the semantics adequately. Instead of a direct 1:1 mapping between an axiom's components and the natural language rendering, the more natural-sounding sentences were preferred, therewith linking an axiom type as a whole to a template.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Temporal logics</kwd>
        <kwd>Temporal ontologies</kwd>
        <kwd>Controlled Natural Language</kwd>
        <kwd>Temporal conceptual models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Time is pervasive in communication and relevant for almost any subject domain
of interest. For instance, a business rule that states that any manager of a
company must already be an employee of that company, biological knowledge that
each butter y used to be a caterpillar, and census information stating that a
divorce can only occur if there was a marriage before. Several options are at one's
disposal to represent such temporal information, be this for ontology development
or information system design. For ontology, the focus has been on fundamental
representation choices such as 3-dimensional objects with time vs 4-dimensional
entities. For representation languages, the emphasis is on features to represent
more or less temporal constraints and automated reasoning over it, which can
be grouped into ontology languages [
        <xref ref-type="bibr" rid="ref2 ref22 ref24 ref3 ref9">2,3,9,22,24</xref>
        ] and popular conceptual data
modelling languages, such as the UML Class Diagram, Entity-Relationship, and
Object-Role Modeling languages [
        <xref ref-type="bibr" rid="ref10 ref12 ref14 ref17 ref18 ref2 ref21 ref23 ref4">2,4,10,12,14,17,18,21,23</xref>
        ]. These works concern
steps before involving modellers and domain experts. However, given that
modellers have great di culty with using such temporal representation languages [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],
then these advances are unlikely to be used. The two principal approaches to
address this problem is to use a graphical notation or natural language sentences. To
illustrate: a sample model in the TREND language [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] is shown in Figure 1-A.
This is not immediately clear to anyone unless trained in the semantics of the
temporal adornments (such as \Dex"; explained further below) [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Its logic-based
reconstruction in the DLRUS Description Logic (DL) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], shown in Figure 1-B,
is typically even less accessible to modellers. The remaining option is a natural
language rendering, which is what we focus on in this paper.
      </p>
      <p>A. Sample temporal model in TREND notation</p>
      <p>Board
Member</p>
      <p>EmpID</p>
      <p>DEXDEV</p>
      <p>Employee
Manager</p>
      <p>Office
(0,n)
DEX
(1,n)
work
manage</p>
      <p>(1,n)
DEX</p>
      <p>Project
(1,1)</p>
      <p>B. Partial logic-based reconstruction
in DLRus notation</p>
      <p>C. What we aim for: natural language rendering of temporal constraints</p>
      <p>
        The natural language option means to verbalise structured input or use
Natural Language Generation (NLG). Atemporal verbalisation has been successful
for both conceptual data models [
        <xref ref-type="bibr" rid="ref13 ref6">6,13</xref>
        ] and ontologies [
        <xref ref-type="bibr" rid="ref1 ref25 ref27 ref5 ref7">1,5,7,25,27</xref>
        ]; for instance,
for the axiom M anager v Employee and a template Each [subclass] is a(n)
[superclass] for simple subsumption, the verbalisation will generate Each
Manager is an Employee. It is an obvious step to seek to use such a template-based
approach also for the temporal constraints. Existing works only generate text
from temporal data rather than information and knowledge; e.g., sample data for
ORM diagrams [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], time series data [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and querying temporal databases [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>The aim is thus to nd out what is the best way of verbalising the temporal
constraints and answer 1) Does each proposed natural language sentence template
capture the semantics of the temporal constraint adequately? and 2) Which
sentence among the options is preferred? We used the semantics of the Description
logic (DL) DLRUS as structured information and knowledge representation, as
it currently has the most comprehensive set of temporal constraints and it
easily can be mapped to one's preferred logic or modelling language. We discuss
the template development to verbalise the 34 temporal constraints. One or more
templates were devised for each temporal constraint. The templates were
evaluated by three temporal logic experts and ve `mixed experts' (experts in
modelling, logic, or NLG, but not temporal). There was little unanimous agreement
on template preferences among the experts. The `mixed experts' judged many
more sentences to be correct than the experts, yet there was even less agreement
among the participants. Overall, 26 of the 34 constraints did result in preferred
sentences, and the remaining 8 sentences were updated by taking into account
the written feedback. These nal templates map an axiom type as a whole to the
template as a whole, rather than by consituent.</p>
      <p>In the remainder of the paper, we rst describe preliminaries in Section 2.
Possible templates with word choices are discussed in Section 3. The evaluation
is presented in Section 4. We discuss and conclude in Sections 5 and 6.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Preliminaries: language and time</title>
      <p>Linguistically, there are two principal ways to refer to temporal points and
intervals in a sentence: using verb tenses, such as `have eaten' and `will eat', or
prepositions and adjuncts, such as `before' and `some time later', or both to stress
the time dimension and relation between events at points or during intervals, like
`have eaten before [some other event]'. The major languages in the world have
between zero (e.g., Chinese) and three (e.g., Romance languages) tenses, with
variations using compound forms with auxiliary verbs.</p>
      <p>Within commonly used information and knowledge representation that we
restrict ourselves to here, not all verb tenses and adjuncts will be needed, because
it is a restricted application domain concerning tracking the evolution of objects,
relations, and, possibly, attributes over time, not, say, events that did not
happen in the past (`could/would have done'). The core relevant temporal aspects
are depicted in Figure 2. First, we have \snapshot (rigid)", which is essentially
atemporal, or `at all times' for the duration of the entity's existence. The
\temporal options (antirigid)" denotes that an entity is an instance of a type at some
time, but not at all times, which is indicated with a non-solid line. There are
four core transition constraints: \extension" means that at some time an entity
also instantiates another type and \evolution" means that the entity instantiates
one type after another. These constraints may be quantitative (a xed amount of
time), and are either optional (universally quanti ed) or mandatory (existentially
now</p>
      <p>flow of time
snapshot (rigid)
} temporal options (antirigid)
extension in the future
evolution in the future
extension in the past
evolution in the past
quanti ed). As they can be declared for entity types, relationships, and attributes,
this amounts to 48 possible temporal constraints. These changes can be covered
by just a few verb tenses. Mainly, they constitute choices on the future single vs
future continuous (respectively, the past).</p>
      <p>Some of the temporal constraints are computationally more interesting than
others. In particular, constraints on the future are trivially satis ed and thus
cannot be checked, whereas constraints about the past|which must be present in
a prior state of the data or knowledge base|and quantitative constraints can be
checked. Also, it was di cult to devise good examples for some of the attribute
constraints, and they are not used often in ontologies anyway. Taking this into
account, we reduced it to 34 axiom types out of the 48. Further, it makes sense to
include domain and range when verbalising a relationship of a conceptual model.
This context is necessary because a conceptual model may reuse the name of an
attribute or relationship, but never with the same entity types. This is in contrast
with relations in ontologies that do not require a domain and range restriction,
and as also re ected in DLRUS . We have made templates for both scenarios,
but it appeared that the templates for the relations (OWL object properties, DL
roles) in ontologies always resulted in a subset of those of conceptual models such
that it required one conversion rule (illustrated below). Therefore, we opt here
for the more comprehensive ones with domain and range.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Speci c template options</title>
      <p>
        We created 1-7 candidate templates for each constraint, which would verbalise
the constraints more or less precisely or colloquially. For each list of options for a
constraint, the rst one is most literal with respect to the formal semantics, and
the other ones are more or less precise rewordings that sound less `clunky' and
arti cial. Regarding the formal counterpart, we rely on the formal foundations of
TREND, being the semantics of DLRUS [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], so as not to clutter the paper with
too much repetition and syntax notation. The semantics here and in the following
subsections is based on [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] that was extended with temporal relationships [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
and the additional mandatory constraints are adapted from [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Considering the
usual model-theoretic semantics, we use a temporal interpretation of the signature
of a conceptual data model M. This is a structure of the form: I = (Z; &lt;
); I ; f I(t) j t 2 Zg ; where (Z; &lt;) is the set of integers denoting the intended
ow of time, I 6= ; is the interpretation domain divided into IC over classes
and ID over data types, and I(t), for t 2 Z, is the interpretation function which
assigns a set CI(t) I to each entity type C 2 C, a set RI(t) of tuples over
      </p>
      <p>IC IC to each relation R 2 R and a set AI(t) of tuples over IC ID to each
attribute A 2 A. While DLRUS permits n-ary relations, we present just the case
for binaries. The formalisation of all constraints is available in the supplementary
material at http://www.meteck.org/files/CREOL17suppl.zip.</p>
      <sec id="sec-3-1">
        <title>3.1. Model elements</title>
        <p>The entity types, relationships, and attributes can be divided into atemporal
(`snapshot') and temporal entities, where the former has no explicit speci cation
of time|or: holds globally at all times|and the latter do. A temporal entity type
is formalised as o 2 CI(t) ! 9t0 6= t:o 2= CI(t0). A template option with a closer
1:1 match between the axiom type with its structure and the natural sentence
and, say, the entity type Student would generate If an object is an instance of
entity type Student, then there is some time where it is not a Student or one could
paraphrase it as Each Student is not a Student for some time, among the possible
options.</p>
        <p>For temporal relationships, with the semantics r 2 RI(t) ! 9t0 6= t:r 2=
RI(t0), we devised two options that amounted to largely just shu ing around the
constituents of the template, with Ci an entity type and Ri a relationship:
(a) The objects in the facts in ..C1.. ..R1.. ..C2.. do, at some time, not relate through ..R1..
(b) The objects participating in a fact in ..C1.. ..R1.. ..C2.. do not relate through ..R1.. at
some time.</p>
        <p>Note that for an ontology setting, one can simply drop the C1 and C2 variables for
the entity types: The objects in ..R1.. do, at some time, not relate through ..R1.. .</p>
        <p>The semantics of a basic temporal attribute is o 2 CI(t) ^ ho; di 2 AI(t) !
9t0 6= t:ho; di 2= AI(t0), where the templates assume that any `has' from the
attribute's name is dropped if it is already in the name (e.g., hasColour), or it is
substituted with the verb in the attribute's name. For instance, its option (e) with
an example about bonus payments would generate a sentence alike An Employee
receives a Bonus, but not always.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Dynamic constraints</title>
        <p>The two basic types of dynamic constraints are extension and evolution (recall
Figure 2), where extension has the element remain a member of the source class
and in an evolution it stops being member of the source class once it evolves to
the target class. This may be at `some' time or at a metric (quantitative) time,
and it may persist or not. They can be optional or mandatory, i.e., whether some
object, relation, or attribute may evolve or all objects/relations that instantiate
the class/relationship must evolve. This can be verbalised more or less harshly,
just like with atemporal constraints2. That is, for future tense one can use the
auxiliary verb `will' versus the stronger-sounding `has to' or `must'. Likewise, for
the past there is a similar type of di erence between `was already/before/earlier,
but not now' vs. `must have been'. For instance, mandatory dynamic evolution in
the past (DevM ), i.e., o 2 DevM IC(1t;)C2 ! (o 2 C1I(t) ! 9t0 &lt; t:o 2 DevIC(1t;0C)2 )
where the semantics of Dev is o 2 DevIC(1t;)C2 ! (o 2 C1I(t) ^ o 2= C2I(t) ^ o 2
C2I(t+1) ^ o 2= C1I(t+1)), with, e.g., Butter y (to be lled in for C2 in the template)
and the Caterpillar (C1) it used to be, with the following possible templates:
(a) Each ..C1.. must have been a(n) ..C2.. , but is not a(n) ..C2.. anymore.
(b) Each ..C1.. was a(n) ..C2.. before, but is not a(n) ..C2.. now.
(c) If ..C1.. , then ..C1.. was a(n) ..C2.. before, but is not a(n) ..C2.. anymore.</p>
        <p>Persistence (PDex/PDev) has the change holding at all times in the future,
which is built from whatever will be chosen from the possible templates and
appended by a phrase like , and this remains so. or , and this remains so inde nitely..</p>
        <p>For quantitative extension and evolution, we need a speci c number for
counting and, implicitly, some time unit to be able to construct, e.g., `after
2e.g., `each Prof teaches at least one course' vs. `each Prof must teach at least one course'.
at least 3 years'. The number is denoted with the variable D1 in the
template. For instance, mandatory quantitative extension in future (QexM), i.e.,
o 2 QexIC(1t;)C2 ! (o 2 C1I(t) ! 9(t + n) &gt; t:o 2 QexIC(1t;+Cn2)), e.g., all Students (to
be slotted in at C1) have to Volunteer (C2) in the second year (D1) of their study,
with template options:
(a) Each ..C1.. will also become a(n) ..C2.. after [at least/at most/exactly] ..D1.. .
(b) If ..C1.. for [at least/at most/exactly] ..D1.. , then ..C1.. becomes a(n) ..C2.. as well.</p>
        <p>Regarding word choice in template design for relationships, the transition
concerns overlapping or successive processes; thus verbs such as `precede' and
`follows' are applicable. On their own, they do not distinguish between the two
cases of whether the relations may co-exist or if one occurs after the other. This
can be addressed by disambiguating both cases, or one of the two with the other
left implicit. We chose the latter option, and add it to the evolution cases rather
than the extension cases, as they are stricter constraints. Likewise, `sequentially'
and `successively' are roughly synonyms and imply that earlier state has ended,
so the only core di erence to test is whether that should be made explicit, e.g.,
with inclusion of terms such as `ending' or `terminating', or not. For instance,
for mandatory dynamic extension for relationships in the past (RDexM ), i.e.,
ho; o0i 2 RDexMR1;R2 I(t) ! (ho; o0i 2 R2I(t) ! 9t0 &lt; t:ho; o0i 2 RDexR1;R2 I(t0)),
where the semantics of `just' RDex is ho; o0i 2 RDexR1;R2 I(t) ! (ho; o0i 2
R1I(t) ! 9t0 &gt; t:ho; o0i 2 R2I(t0)), option (a) was Each ..C1.. ..R1.. ..C2.. is preceded
by ..C1.. ..R2.. ..C2... For instance, every passenger who boards a ight must have
had a check-in process before with its template option (a) then results in a
somewhat clunky Each Passenger boards Flight is preceded by Passenger checksIn
Flight. Note that also here it is easy to see how this template can be adapted
for ontologies by dropping the C1 and C2 variables.</p>
        <p>These time markers are more challenging with the more complex
constraints. For instance, mandatory dynamic evolution for relationships in the past
(RDevM ), with the typical example that any pair of humans who are divorced
were married before that. The full set of template options to choose from was:
(a) Each ..C1.. ..R1.. ..C2.. is strictly preceded by ..C1.. ..R2.. ..C2.. .
(b) Each ..C1.. ..R1.. ..C2.. is preceded by ..C1.. ..R2.. ..C2.. and they are not in that ..C1..</p>
        <p>..R2.. ..C2.. relation anymore.
(c) If ..C1.. ..R1.. ..C2.. , then it was preceded by ..C1.. ..R2.. ..C2.. and they are not in that
..C1.. ..R2.. ..C2.. relation now.
(d) Each ..C1.. ..R1.. ..C2.. must have been preceded by ..C1.. ..R2.. ..C2.. and they are then
not in that ..R2.. relation anymore.
(e) If ..C1.. ..R1.. ..C2.. , then it must have been preceded by ...C1.. ..R2.. ..C2.. , but ..C1..</p>
        <p>not ..R2.. ..C2.. anymore.</p>
        <p>Two dynamic attribute constraints were included in the evaluation, which
were uncontentious, and therefore they are omitted here due to space limitations.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Evaluation</title>
      <p>The templates designed for the temporal elements and constraints are evaluated
aiming to answer:
1. Does each proposed template for a natural language sentence capture the
semantics of the temporal constraint adequately?
2. Which sentence among the options is preferred?
The principal approach is to use a two-pronged survey: a small group of experts
in temporal logic, and a `mixed' group of experts in related relevant elds that is
not temporal logic, which includes modellers, NLG experts, and logicians.</p>
      <sec id="sec-4-1">
        <title>4.1. Materials and methods</title>
        <p>A survey was designed with the temporal constraints and elements, and 1-7
templates for each. The participants were given a brief written explanation of the
logic and how to read a template, an example for each constraint, and the scope
of the evaluation. They were instructed to evaluate each template on whether
it would capture the meaning adequately, which could be answered with either
\yes", \sort of" denoting borderline, or \no", and which of the templates they
preferred, if any, among the set of templates for that constraint. They also were
allowed to comment on each template option.</p>
        <p>The three temporal logic experts are remote colleagues and were recruited by
email through purposive sampling. The mixed group also was recruited through
purposive sampling, with as prerequisite that they have a good to excellent
understanding of modelling, logic, or NLG. No personal information was recorded other
than whether they have English as their mother tongue language. The answers
were collected in a pre-formatted spreadsheet. A follow-up interview with one
expert was also conducted to obtain further qualitative feedback on the choices.</p>
        <p>All materials and results are available at http://www.meteck.org/files/
CREOL17suppl.zip.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Results and discussion</title>
        <p>We present rst the results of the experts and then those of the mixed group.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.2.1. Experts' judgements</title>
        <p>An overview of the quantitative results is included in Table 1. 41% of the
templates were deemed to properly represent the semantics of the temporal
constraint, though only 12 templates received the same score (either all \yes", \sort
of", or \no") with most (78) receiving two the same verdicts, reaching 89% then.
Four templates of constraints were unanimously preferred: those for Mandatory
Quantitative Extension and for Evolution (QexM and QevM) and the two
attribute constraints (Freez `frozen attribute' and AQev `Quantitative evolution,
attribute'). With majority voting, this increased to 13 constraints. This is
remarkable, because the experts know each other well and have collaborated. Even
the simple constraint of `temporary class' (Tc) had three di erent verdicts for its
option (b) ..C1.. is an entity type whose objects are, for some time in their existence,
not instances of ..C1.., as did option (b) of dynamic evolution in the past (Dev ).</p>
        <p>Quantitative extension and evolution used the grammatically correct `for' in
the sentence, but this was deemed wrong. Instead, the experts preferred `since'.
This may be due to either the Since operator in the logic, or it has a stronger
sense of time and fewer senses than the multiple-use `for', or that neither of the
experts has English as mother tongue. A follow-up interview on this matter with
one of the experts (e3 in the data) revealed that at least for e3 it was not so much
about `for' vs `since' but the ne-grained distinction between \for an x amount
of time since x" (or: holding between x ago and now) vs. \x chronons ago" but it
may not hold some time between x and now. On closer inspection, the logic stated
the latter, while the former was intended, which is what caused the confusion.</p>
        <p>Regarding `preceded by' and `followed by' in the templates (recall Section 3.2),
there were a few comments such as \I don't like \followed" that can be understood
as \at the next time point"". Thus, only using strictly/immediately to indicate the
next/previous time point and therewith leaving implicit when this may not be the
case when it is not stated explicitly was found to be ambiguous. Put di erently:
an explicit time marker was perceived to be needed also for the `some time'. We
updated the templates accordingly (see online supplementary material).</p>
        <p>
          An important result to note for the preferred templates, is that they do not
follow the structure of the axiom, regardless whether it would be rendered in the
formal semantics or DLRUS syntax. That is, the preferred templates amount to a
mapping between an axiom type rather than the axiom's structure. To illustrate:
{ Formal Semantics: o 2 DevM IC(1t;)C2 ! (o 2 C1I(t) ! 9t0 &lt; t:o 2
DevIC(1t;0C)2 ): \For objects involved in a mandatory dynamic evolution in the
past, if o is an instance of C1, then there exists a time t0 earlier than time
t such that at that earlier time t0 it evolved from C1 to C2."
{ DLRUS shorthand notation: C1 v 3 DevC1;C2 : \Each C1 is a subclass of
some time in the past dynamically evolved from C1 to C2"
{ DLRUS full notation: C1 v C1 u :C2 u (:C1 u C2): \Each C1 is a subclass
of C1 and not C2 and at the next moment (not C1 and C2)"
versus the preferred rendering Each C1 was a C2 before, but is not a C2 now. Not
linking each axiom component to a fragment of the natural language sentence
deviates from common practices of verbalising ontologies and conceptual models
(e.g., [
          <xref ref-type="bibr" rid="ref13 ref25 ref27">13,25,27</xref>
          ]) even when they may be using additional grammar rules to make
the output sentence grammatically better [
          <xref ref-type="bibr" rid="ref11 ref16 ref7">7,11,16</xref>
          ]. It might suggest that
templates with fewer words were preferred. This is not substantiated by the data,
however: 12 preferences were sole or shared shortest template in the sense of
number of words, 9 were sole or shared longest template, and 3 were neither.
        </p>
        <p>The follow-up interview with expert e3 included a clari cation on the
aforementioned for/since issue. Expert e3 also noted that if neither expert has English
as rst language, this may have contributed to the low amount of unanimity.
It may seem disconcerting that experts each use their own terminology, but e3
did not see that as a real issue, \for there is the logic that does have the precise
meaning anyway" and thus \resolves any confusion that may arise from using
slightly di erent terminology" (paraphrased). In this light, it is not likely that
asking many more temporal logic experts will make the results converge. Lastly,
e3 suggested that the relative large di erence in \yes" between e3 and e1 (29 vs
62 `yes') may be due to attitude toward judging, in that e3 aimed for one and at
most two \yes" per constraint. However, this does not explain why e2 had only
34 \yes", but where no such criterion could have been used.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.2.2. Mixed experts' assessment results</title>
        <p>The aggregate result for the mixed experts are included in Table 1. The main
interesting outcome is the large di erences with the temporal logic experts on whether
the templates capture the semantics adequately. The mixed experts deemed many
more sentences to be fully or borderline acceptable. This is in large part
explainable in that the experts have a better grasp of the subtleties of the temporal
constraints. A clear illustration of this is RDevM `Dynamic evolution for
relationships, past, mandatory' option (a), where e1 had commented \Absolutely false!"
with 2 \no" and 1 \sort of" from the experts, yet it had 3 \yes" and 2 \sort of"
from the mixed group, and Sr `Snapshot relationship' option (a) received 3 \no"
from the experts, yet 2 \yes" and 3 \sort of" from the mixed group.</p>
        <p>Further, the aggregate evens out the more strict grading by the single mixed
expert who has English as rst language (p1 in the data), which may also
contribute to assessing precision of verbalising the constraints, and one of the two
logicians who is well-versed in modal logics and thus may grasp the nesses of
temporal logics better. The aforementioned for/since issue of Qex `Quantitative
extension, past, optional' and QexM `Quantitative extension, past, mandatory'
was absent from the mixed group, who deemed it mostly acceptable.</p>
        <p>Regarding preferences for a particular template, there was no unanimous
preference on any template, 4 where 4 out of 5 agreed on a preference, and 17 by
majority voting (3 out of 5). As to unanimity of verdicts, the mixed group answered
the same on 6 templates. There is a slight preference for shorter sentences: 13
preferences were sole or shared shortest template, 5 were sole or shared longest
template, and 4 were neither.</p>
        <p>Few comments were made by the mixed participants. Recurring ones
include NLG expert (p2)'s option that several templates were either vague (e.g.,
option (a) of Tc `Temporal class'), repetitive (PDex/PDev `Persistent
extension/evolution'), or that it \does not sound natural enough" (e.g., Dev
`Dynamic evolution, past, optional'). Participant p1 provided most feedback on word
choices and preferences; e.g., instead of ..., but is not now in Qev `Quantitative
evolution, past, optional' and QevM `Quantitative evolution, past, mandatory',
rather ..., but is not a C2 now, a dislike for the use of sequentially in dynamic
evolution templates (which the experts marked down as well), and on ceasing in
the template suggesting instantaneous change \rather than stating so explicitly".</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <p>The outcome with the preferred templates is, to the best of our knowledge, the
rst proposal for linking temporal knowledge or information to natural language.
The number of participants is relatively small, but a larger group will neither
resolve the low inter-annotator agreement of the temporal logic experts, nor the
comparatively high `yay-saying' among the mixed expert group whose di erence
would likely be exacerbated with, say, a group of 4th year student participants
that are less conversant in temporal constraints. It is nigh on impossible to
examine whether a non-expert group would really have understood the logic, because it
would require participants to communicate the meaning in a di erent mode than
the natural language, and those alternative modes were precisely a problem that
the natural language approach aimed to address. rendering it di cult to discern
whether a lack of understanding may be due to the other representation,
Simplicity or potential di culty of the templates, as measured by number of words,
did not show unequivocal preference for shorter templates (hence, sentences),
especially among the experts. The data collected cannot explain this, and it thus
merits further investigation whether some temporal constraints indeed cannot be
simpli ed further without losing their meaning.</p>
      <p>
        Looking back at Figure 1, the temporal entities and constraints are now
verbalised as shown in Figure 1-C. One might pose that once implemented, it may
end up in too many sentences for a modeller to check. However, one could 1)
further prioritise constraints and 2) rely on an automated reasoner. Regarding
prioritisation, the mandatory, past, and quantitative constraints are more interesting
from an information systems point of view, for they can be easily implemented
in a database as integrity constraints. Optional past and future constraints may
be interesting for querying and database updates only. Regarding the latter: with
the logic foundation, one could specify just a few important temporal constraints
and let the rest be inferred by the reasoner thanks to the logical implications
[
        <xref ref-type="bibr" rid="ref14 ref17 ref4">4,14,17</xref>
        ]; e.g., if the relationship is temporal, then so are the participating classes,
and if a superclass is temporal then so are its subclasses.
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>Template selection of temporal constrains in temporal logics and logic-based
temporal conceptual modelling languages showed low expert inter-annotator
unanimous agreement, although 89% with majority voting. The experts were more
strict (41%) on whether a template captured the semantic than the mixed group
(64%), noting that there were few unanimous preferences. Taking into account
judgement of semantics, indicated preferences, and comments, all 34 axiom types
now have a template for verbalisation. The templates map as a whole to an axiom
type rather than their constituents.</p>
      <p>
        We have recently completed a modelling experiment showing that, on the
whole, the template-based natural language was preferred over other notations
(semantics, DL, diagram, coding-style) especially for the more complex
constraints [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Therefore, we plan to create bi-directional mappings between the
logic and the (pseudo-)natural language and design a multi-modal modelling
interface. We also expect that it then will be easier to collect data to investigate
the e ect natural language renderings on modelling further.
      </p>
      <p>Acknowledgments The author would like to thank the participants for their
valuable feedback and the reviewers for their suggestions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Androutsopoulos</surname>
          </string-name>
          , G. Lampouras, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Galanis</surname>
          </string-name>
          .
          <article-title>Generating natural language descriptions from owl ontologies: the naturalowl system</article-title>
          .
          <source>Journal of Arti cial Intelligence Research</source>
          ,
          <volume>48</volume>
          :
          <fpage>671</fpage>
          {
          <fpage>715</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Artale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Franconi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          .
          <article-title>A temporal description logic for reasoning about conceptual schemas and queries</article-title>
          . In S. Flesca,
          <string-name>
            <given-names>S.</given-names>
            <surname>Greco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Leone</surname>
          </string-name>
          , and G. Ianni, editors,
          <source>Proceedings of the 8th Joint European Conference on Logics in Arti cial Intelligence (JELIA-02)</source>
          , volume
          <volume>2424</volume>
          <source>of LNAI</source>
          , pages
          <volume>98</volume>
          {
          <fpage>110</fpage>
          . Springer Verlag,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Artale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kontchakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolter</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          .
          <article-title>Temporalising tractable description logic</article-title>
          .
          <source>In Proc. of the 14th International Symposium on Temporal Representation and Reasoning (TIME-07)</source>
          ,
          <year>2007</year>
          . Alicante,
          <year>June 2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Artale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Parent</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Spaccapietra</surname>
          </string-name>
          .
          <article-title>Evolving objects in temporal information systems</article-title>
          .
          <source>Annals of Mathematics and Arti cial Intelligence</source>
          ,
          <volume>50</volume>
          (
          <issue>1-2</issue>
          ):5{
          <fpage>38</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Bouayad-Agha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Casamayor</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Wanner</surname>
          </string-name>
          .
          <article-title>Natural language generation in the context of the semantic web</article-title>
          .
          <source>Semantic Web Journal</source>
          ,
          <volume>5</volume>
          (
          <issue>6</issue>
          ):
          <volume>493</volume>
          {
          <fpage>513</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Burden</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Heldal</surname>
          </string-name>
          .
          <article-title>Natural language generation from class diagrams</article-title>
          . In S. Weissleder,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lucio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cichos</surname>
          </string-name>
          , and F. Fondement, editors,
          <source>Proceedings of the 8th International Workshop on Model-Driven Engineering</source>
          ,
          <article-title>Veri cation and Validation (MoDeVVa'11)</article-title>
          .
          <source>ACM Proceedings</source>
          ,
          <year>2011</year>
          .
          <volume>17</volume>
          <issue>October 2011</issue>
          , Wellington, New Zealand.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N. E.</given-names>
            <surname>Fuchs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kaljurand</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          .
          <source>Discourse Representation Structures for ACE 6.6. Technical Report i -2010</source>
          .0010, Dept of Informatics, University of Zurich, Switzerland,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gianni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bocciarelli</surname>
          </string-name>
          , and
          <string-name>
            <surname>A. D'Ambrogio</surname>
          </string-name>
          .
          <article-title>Temporal capabilities in support of conceptual process modeling using object-role modeling</article-title>
          .
          <source>In Proceedings of the Symposium on Theory of Modeling and Simulation-DEVS Integrative</source>
          ,
          <year>2014</year>
          . Tampa, ?Florida, USA, April,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Gimenez-Garc</surname>
          </string-name>
          <string-name>
            <surname>a</surname>
          </string-name>
          , A. Zimmermann, and
          <string-name>
            <given-names>P.</given-names>
            <surname>Maret</surname>
          </string-name>
          .
          <article-title>Nd uents: An ontology for annotated statements with inference preservation</article-title>
          . In E. Blomqvist et al., editors,
          <source>Proc. of ESWC'17</source>
          , volume
          <volume>10249</volume>
          <source>of LNCS</source>
          , pages
          <volume>538</volume>
          {
          <fpage>654</fpage>
          . Springer,
          <year>2017</year>
          . 30 May - 1
          <source>June</source>
          <year>2017</year>
          , Portoroz, Slovenia.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Gregersen</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Jensen</surname>
          </string-name>
          .
          <article-title>Temporal entity-relationship models - a survey</article-title>
          .
          <source>IEEE Trans. Knowl</source>
          . Data Eng.,
          <volume>11</volume>
          (
          <issue>3</issue>
          ):
          <volume>464</volume>
          {
          <fpage>497</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gruzitis</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Barzdins</surname>
          </string-name>
          .
          <article-title>Towards a more natural multilingual controlled language interface to OWL</article-title>
          .
          <source>In Proceedings of the Ninth International Conference on Computational Semantics, IWCS '11</source>
          , pages
          <fpage>335</fpage>
          {
          <fpage>339</fpage>
          ,
          <string-name>
            <surname>Stroudsburg</surname>
          </string-name>
          , PA, USA,
          <year>2011</year>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Halpin</surname>
          </string-name>
          .
          <article-title>Temporal modeling and ORM</article-title>
          . In R. Meersman,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Tari</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Herrero</surname>
          </string-name>
          ., editors,
          <source>OTM 2008 Workshops</source>
          , volume
          <volume>5333</volume>
          <source>of LNCS</source>
          , pages
          <volume>688</volume>
          {
          <fpage>698</fpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Halpin</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Morgan</surname>
          </string-name>
          .
          <article-title>Information modeling and relational databases</article-title>
          . Morgan Kaufmann, 2nd edition,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C. M. Keet</surname>
            and
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Artale</surname>
          </string-name>
          .
          <article-title>A basic characterization of relation migration</article-title>
          . In R. Meersman et al., editors,
          <source>OTM Workshops, 6th International Workshop on Fact-Oriented Modeling (ORM'10)</source>
          , volume
          <volume>6428</volume>
          <source>of LNCS</source>
          , pages
          <volume>484</volume>
          {
          <fpage>493</fpage>
          . Springer,
          <year>2010</year>
          .
          <source>October 27-29</source>
          ,
          <year>2010</year>
          , Hersonissou, Crete, Greece.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>C. M. Keet</surname>
            and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Berman</surname>
          </string-name>
          .
          <article-title>Determining the preferred representation of temporal constraints in conceptual models</article-title>
          .
          <source>In 36th International Conference on Conceptual Modeling (ER'17)</source>
          , LNCS, page (in
          <source>print)</source>
          . Springer,
          <year>2017</year>
          . 6-
          <issue>9</issue>
          <year>Nov 2017</year>
          , Valencia, Spain.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>C. M. Keet</surname>
            and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Khumalo</surname>
          </string-name>
          .
          <article-title>Toward a knowledge-to-text controlled natural language of isiZulu</article-title>
          .
          <source>Language Resources and Evaluation</source>
          ,
          <volume>51</volume>
          (
          <issue>1</issue>
          ):
          <volume>131</volume>
          {
          <fpage>157</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>C. M. Keet</surname>
            and
            <given-names>E. A. N.</given-names>
          </string-name>
          <string-name>
            <surname>Ongoma</surname>
          </string-name>
          .
          <article-title>Temporal attributes: their status and subsumption</article-title>
          . In H. Kohler and M. Saeki, editors,
          <source>Asia-Paci c Conference on Conceptual Modelling (APCCM'15)</source>
          , volume
          <volume>165</volume>
          <source>of CRPIT</source>
          , pages
          <volume>61</volume>
          {
          <fpage>70</fpage>
          . Conferences in Research and Practice in Information Technology,
          <year>2015</year>
          .
          <fpage>27</fpage>
          -
          <issue>30</issue>
          <year>January</year>
          ,
          <year>2015</year>
          , Sydney, Australia.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Khatri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. T.</given-names>
            <surname>Snodgrass</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Terenziani</surname>
          </string-name>
          .
          <article-title>Capturing telic/atelic temporal data semantics: Generalizing conventional conceptual models</article-title>
          .
          <source>Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>26</volume>
          (
          <issue>3</issue>
          ):
          <volume>528</volume>
          {
          <fpage>548</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mar</surname>
          </string-name>
          n
          <string-name>
            <given-names>and D.</given-names>
            <surname>Sanchez</surname>
          </string-name>
          .
          <article-title>On generating linguistic descriptions of time series</article-title>
          .
          <source>Fuzzy SetsandSystems</source>
          ,
          <volume>286</volume>
          :6{
          <fpage>30</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nelken</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Francez</surname>
          </string-name>
          .
          <article-title>Querying temporal databases using controlled natural language</article-title>
          .
          <source>In Proceedings of the 18th conference on Computational linguistics-Volume</source>
          <volume>2</volume>
          , pages
          <fpage>1076</fpage>
          {
          <fpage>1080</fpage>
          . Association for Computational Linguistics,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>E. A. N.</given-names>
            <surname>Ongoma</surname>
          </string-name>
          .
          <article-title>Formalising temporal attributes in temporal conceptual data models</article-title>
          .
          <source>Msc thesis</source>
          , Department of Computer Science,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>N.</given-names>
            <surname>Papadakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stravoskoufos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Baratis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. G.</given-names>
            <surname>Petrakis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Plexousakis</surname>
          </string-name>
          .
          <article-title>PROTON: A Prolog Reasoner for Temporal ONtologies in OWL</article-title>
          .
          <source>Expert Systems with Applications</source>
          ,
          <volume>38</volume>
          :
          <fpage>14660</fpage>
          {
          <fpage>14667</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>C.</given-names>
            <surname>Parent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Spaccapietra</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Zimanyi</surname>
          </string-name>
          .
          <article-title>Conceptual modeling for traditional and spatio-temporal applications|the MADS approach</article-title>
          . Berlin Heidelberg: Springer Verlag,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Preventis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Marki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. G.</given-names>
            <surname>Petrakis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Batsakis</surname>
          </string-name>
          .
          <article-title>Chronos: A tool for handling temporal ontologies in protege</article-title>
          .
          <source>In Proc. of ICTAI'12</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>H.</given-names>
            <surname>Safwat</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Davis</surname>
          </string-name>
          .
          <article-title>CNLs for the semantic web: a state of the art</article-title>
          .
          <source>Language Resources &amp; Evaluation</source>
          ,
          <volume>51</volume>
          (
          <issue>1</issue>
          ):
          <volume>191</volume>
          {
          <fpage>220</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>T.</given-names>
            <surname>Shunmugam</surname>
          </string-name>
          .
          <article-title>Adoption of a visual model for temporal database representation</article-title>
          .
          <source>M. IT thesis</source>
          , Department of Computer Science, University of Cape Town, South Africa,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Third</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Williams</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Power</surname>
          </string-name>
          .
          <article-title>OWL to English: a tool for generating organised easily-navigated hypertexts from ontologies</article-title>
          . poster/demo paper, Open Unversity UK,
          <year>2011</year>
          . 10th
          <source>International Semantic Web Conference (ISWC'11)</source>
          ,
          <fpage>23</fpage>
          -
          <lpage>27</lpage>
          Oct 2011, Bonn, Germany.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>