<!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>Mining, Representation and Reasoning with Temporal Expressions in the Legal Domain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mar a Navas-Loro?</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ontology Engineering Group, Universidad Politcnica de Madrid</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Reasoning on temporal references present in free text documents is a challenging problem demanding the synergy of several disciplines in Arti cial Intelligence. First, Natural Language Processing (NLP) techniques are necessary to mine temporal expressions (referring to instants and events) and their relations; then, knowledge representation systems able to support more than trivial temporal information must be de ned; nally, temporal logic systems exposing practical functionality are much demanded. Documents in the legal domain are rich in temporal expressions, often linked to a norm. Permissions, obligations and prohibitions are often bounded by temporal constraints. While there exist di erent rules and policy languages capable of representing temporal constraints to some extent, they are far from being able to express the complex temporal relations present in these legal texts. Reaching a formalized expression of temporal rules able to accommodate the ndings of the NLP algorithms and enabling temporal reasoning in an integrated manner would unleash new possibilities in the area of legal reasoning. As this thesis is still in an early phase, Doctoral Consortium feedback will be extremely valuable for topic delimitation and additional research lines.</p>
      </abstract>
      <kwd-group>
        <kwd>Temporal Constraints</kwd>
        <kwd>Temporal Reasoning</kwd>
        <kwd>Representation</kwd>
        <kwd>Legal Domain</kwd>
        <kwd>Natural Language Processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Temporal
We live in a world where a lot of public documents are freely accessible but
also hard to understand for a human due to concrete and technical expressions
existing in the legal domain. Such is the case of Eur-Lex1, a portal full of
publiclyaccessible legal documents of the European Union available in several languages.</p>
      <p>Already uneasy for humans, making machines to understand legal documents
is a challenging and multidisciplinary task involving several elds of Arti cial
? This Ph.D. thesis is supervised by Dr. Asuncion Gomez-Perez and Dr. V ctor
Rodr guez-Doncel, and it has been partially supported by LPS-BIGGER
(IDI20141259, Ministerio de Econom a y Competitividad) and a research assistant grant
by the Consejo de Educacion, Juventud y Deporte de la Comunidad de Madrid
partially founded by the European Social Fund (PEJ16/TIC/AI-1984).
1 http://eur-lex.europa.eu/homepage.html
Intelligence: on the one hand, Natural Language Processing is required to
analyze documents and queries to extract relevant information; this information
needs to be properly represented. Reasoning methods are also required to answer
to queries considering collected information. Additionally, human intervention
is required to detect the main lacks on current reasoners and the usual legal
understanding issues; human contribution is also useful for nal validation.</p>
      <p>Focusing on the legal domain, treatment of time remains as one of main
challenges, as con rmed by a recent contribution to the eld, the MIREL project2.
Context information, such as the current date at the moment of the query, is
also important when reasoning with temporal constraints. Being aware of the
high complexity of the problem, we consider that the way to address it involves
the integration of all the steps in a single framework, from document
processing to reasoning, since they feed o intrinsically one another. This Ph.D. thesis
will, therefore, propose new representation and reasoning options, along with
resources related to time processing (such as sets of rules or tagged corpora),
in order to build a framework able to process, represent and reason on legal
documents to answer queries related to time.
2</p>
    </sec>
    <sec id="sec-2">
      <title>State of the Art</title>
      <p>
        Temporal reasoning when applied to the legal domain has not got a lot of
attention lately. Some knowledge bases such as Yago [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] have some mechanisms to
process this kind of information, but one of the last deep studies about the role
of time in Legal Reasoning was performed in the late 90's [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. Reasoning on
time requires research on multiple elds, highlighting among them the
representation to be used (along with the possible restrictions applicable), the temporal
reasoning mechanisms existing and the linguistic processing needed to obtain
the information. The state of the art presented is therefore divided in
Natural Language Processing of temporal expressions, Representation of temporal
expressions and Temporal Reasoning.
2.1
      </p>
      <sec id="sec-2-1">
        <title>Natural Language Processing of temporal expressions</title>
        <p>
          There are several aspects intervening in NLP of temporal expressions, such as
annotation and temporal relation extraction and classi cation. Works in the
latter [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] usually rely on aspects like tense or modality of events and concrete
keywords, using both Machine Learning and knowledge-based methods to tackle
it [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Regarding annotation, the most recent standard is TimeML [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]; although
this is a generic language, sometimes it requires modi cation for its application
to a concrete domain.
        </p>
        <p>
          Despite the major boom in NLP in recent times, both Legal and Temporal
NLP present still open issues, since recent achievements have not been applied
in these elds. Even when temporal tagging is currently covered by several tools
(such as HeidelTime [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] or the Tarsqi Toolkit3), in the annotation step (and
2 http://www.mirelproject.eu/publications/D1.1.pdf
3 http://www.timeml.org/tarsqi/toolkit/index.html
regarding already the reasoning phase) implicit knowledge must also be inferred,
made explicit and processed; also localization derived issues must be handled
both from legal and temporal points of view. Legal tagged corpora and related
resources (such as sets of rules and expressions) are also scarce.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Representation of temporal expressions</title>
        <p>
          Regarding formal representations, a lot of di erent representing options exist,
especially oriented to concrete elds and applications. There are for instance
formal temporal languages (such as Tokio [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] or TProlog [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]) and representations,
mainly thought for planning or veri cation purposes [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]; we can nd among
them TimeGraphs [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], Kripke structures [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] or Temporal Constraint Networks
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. If we limit the scope to general purpose representations in the computer
science eld, the most used ones are ontologies, nding an extensive bunch of
them, such as the W3C OWL-Time Ontology or the Reusable Time ontology
[
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. Other proposals suggest adding a temporal layer to concrete ontological
representations [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], by using for instance Named Graphs [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], or using temporal
querying speci c languages (such as -SPARQL [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]). Also new ideas for
representations arose lately, such as the four-dimensionalist approach [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] or the
representation used by Yago in its second version [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          Finally, for the legal application, OASIS-LegalRuleML [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and ODRL4 can be
used for document representation, at least partially. For constraints and
validation, SHACL5 and ODRL can be highlighted among other languages available,
such as ShEx6; unfortunately, none of them seems to be able to handle time
with enough complexity. Therefore either a temporal expansion or some kind of
connection with temporal resources should be needed.
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Temporal Reasoning</title>
        <p>
          There exist several classical theories on Temporal Logic (TL) [
          <xref ref-type="bibr" rid="ref21 ref26">21,26</xref>
          ], such as
Shoham's [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] or McDermott's [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. They are usually chosen for di erent
applications depending on concrete ontological aspects such as the basic ontological
unit to model time (points or intervals) or if time would be relative or absolute
[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]; this choice can di er even when applying to the same domain depending
on concrete uses [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. Even when there exist subsequent proposals to the
classical ones [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], these remain as the reference in the eld, stressing amongst these
Allen's Interval TL [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], in whose 13 basic temporal binary relations are based
the most of the related resources.
        </p>
        <p>
          Besides the ontological distinctions in TL theories, one of the main problems
when reasoning on time is vagueness: sometimes information is not expressed
clearly as concrete dates but as imprecise terms uneasy to represent formally.
In this context, fuzzy logic ideas have already been applied to deal with vague
4 https://www.w3.org/community/odrl/xml/2.1/
5 https://www.w3.org/TR/shacl/
6 https://www.w3.org/2001/sw/wiki/ShEx
temporal statements such as \late thirties" [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. Also the existence of multiple
possibilities can be expressed by using Fuzzy Branching TL, where di erent
temporal lines allow reasoning about di erent possible worlds [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
        </p>
        <p>
          Temporal reasoning is often related to representation; such is the case of
TProlog and other logic languages. When the chosen representation is an
ontology, logic is usually carried out by Description Logics (DL); when completing a
DL with temporal operators and TL, we obtain a Temporal DL [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] that allow
us to represent and reason on time in ontological environments. Among other
options for logic in ontologies we nd N3Logic [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], a RDF expansion proposed
lately. Despite all these recent options, none has prevailed over the rest as a
standard, nor has been used in the Legal domain; in fact, new e orts in legal
reasoning, such as previously mentioned MIREL project, recognized this lack and
focus in the need of adding a temporal dimension as one of the main research
challenges in the eld.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Problem Statement and Contributions</title>
      <p>As exposed in the previous section, there is a gap between the theoretical logical
formulation and the practical application and representation. The issues found
when trying to formalize temporal information in the legal eld suggests that
current languages can't support temporal reasoning. The main research question
to answer to bridge this gap by building a framework able to deal with temporal
constraints (Fig. 1), with the sub-questions it leads to, is, therefore:</p>
      <p>Are current languages rich enough for formally representing and reasoning
on usually key temporal restrictions in legal documents?
{ Are they tuned with the capabilities of state of the art NLP extraction?
NLP is a domain in constant evolution, and recent advancements in its
techniques might not be properly re ected and exploited in formal representation
and reasoning systems.
{ Are nowadays representation systems able to properly reason for legal
purposes? Can they represent temporal constraints? Would a brand new
representation be needed or could some extension of an existing one be done?
We will at rst focus on chosen languages (OASIS-LegalRuleML, SHACL
and ODRL) for temporal expansion, as it is the framework already proposed,
but maybe other representations would be helpful or could even replace them.
{ Which time-related queries can reasoners answer? What are the main lacks?
We need to nd the current temporal reasoners limitations, identifying the
questions that reasoners can deal with on the di erent representations
available and a list of the most important lacking ones that should also be solved.
{ Are there enough semantic resources for legal NLP to use existing tools?
Even when there are already NLP techniques, schemes and tools for all the
tasks to do, it will be necessary to study them concretely for the legal domain,
that has very speci c structures for both events and temporal expressions.
We plan to study them and make a proper resource by systematizing common
relations and expressions present in legal texts, starting from judgments in
Eur-Lex.</p>
      <p>Main research hypothesis to validate are that an extension over constraint
languages and that the integration of NLP, representation and reasoning would
lead to a more powerful and exible treatment of time. This would allow to
answer queries depending on time and context, such as \Can I access now to a
concrete series or football match on my cable provider?", where each series has
policies attached related to location, age, release dates and kind of customer,
linked also to temporal constraints (often foreign TV series can't be watched
in Spain before a concrete period after original broadcasting). Also application
to grants or calculations on the amount of nes depending on relative times of
infraction and payments could bene t of research on the legal domain.
(2)
(3)
(1)
QUERY
legal
documents</p>
      <p>REASONER
context
(current date,
location…)</p>
      <p>ANSWER
Resources for dealing with temporal expressions in
the legal domain (rules, semantic frames…)</p>
      <p>TemODpoRrLalaenxdteSnHsiAonCsLfor</p>
      <p>Temporal and legal reasoner
Requirements and lacks In order to build the framework, legal texts will be
studied to see what information must be extracted and how to do it; collaboration
of both potential users and experts in the eld will be required to detect main
problematic aspects and the optimal way to handle them. Judgments, one of
the type of documents publicly available in Eur-Lex, will be the starting point.
Once information is identi ed, it must be tagged and represented in the already
existent languages, studying and solving their main lacks to reach what required
by users. Finally, and as exposed in Section 2, temporal reasoning can be tackled
in several ways and depends on representation, being available options Temporal
Description Logics or speci c logic languages such as TProlog. Several proposals
will be examined, choosing the one that better ts the representation.
NLP In (Fig. 1 (1)) the framework receives a query from a user, about one or
several legal documents. All the input is processed by several NLP tools
(annotators, rule systems...). An extensive study has been performed to see the existing
tools and choose the adequate ones for temporal purposes, resulting on formerly
mentioned HeidelTime as a starting point for its exibility on domain-dependent
rule creation and multilingualism. The contribution in this rst step will be
concrete resources to feed this legal temporal text processing, built brand new (such
as a set of legal patterns and tagged corpora from Eur-Lex) or based on existing
semantic resources, such as FrameNet-style set of legal frames representing usual
legal situations.</p>
      <p>Representation Processed information should be represented in chosen
languages (Fig. 1 (2)). Here we will use the previous study about how others
representations handle temporal information and later considerations about reasoning
to extend our representation and make it able to support temporal information
and constraints derived from legal documents and the query. It will also be
populated by information obtained in the NLP step (Fig. 1 (1)).
Reasoning The nal knowledge representation will be the input, along with
contextual information (such as the current date) to the legal reasoner able
to deal with time (Fig. 1 (3)); this will be the result of the study of several
systems and the application of the best method for legal purposes and for the
nal representation. It might be an adaptation of a temporal logic to the legal
context or a brand new alternative, and its output will be the nal answer to
the user's query.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Results and Evaluation Plan</title>
      <p>Since the exposed Ph.D. is an early stage, started in October 2016, there are no
results available yet except the problem identi cation, the partial state of the
art already examined and the pinpointing of the di erent disciplines that will
be part of the thesis working plan.</p>
      <p>Related to evaluation, as exposed in Fig. 1, steps involved in the framework
are sequential, relying on the previous one; each step will have its own evaluation,
based on statistical performance measures for NLP and reasoning given answers
(such as precision or recall) and quality and completeness for representation. We
have already identi ed several resources available for all the intervening elds
that will be useful for training, such as judgments in Eur-Lex portal, COLIEE7
and TREC 89 corpora, resources that use TimeML10 or Temporal Tracks in
SemEval11. Finally, the framework will process, represent and reason on di erent
corpora to see if the representation schema can express information properly and
if the developed reasoning system can answer correctly queries submitted by end
users; if so, the framework would be considered successful.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>This paper presented the outline of a Ph.D. proposal of adding a temporal
dimension to representation and reasoning in the legal eld, addressing the problem in
an integrated manner. This approach intends to improve legal information
processing and perform machine reasoning, making it accessible through a complete
framework that takes legal documents and answers queries about them.
7 http://webdocs.cs.ualberta.ca/~miyoung2/COLIEE2017/
8 http://www.trec-ts.org/downloads
9 https://trec-legal.umiacs.umd.edu/
10 http://www.timeml.org/timebank/timebank.html
11 http://alt.qcri.org/semeval2016/task12/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferguson</surname>
          </string-name>
          , G.:
          <article-title>Events and actions in interval temporal logic</article-title>
          .
          <source>Journal of Logic and Computation</source>
          <volume>4</volume>
          (
          <issue>5</issue>
          ),
          <volume>531</volume>
          {
          <fpage>579</fpage>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Athan</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boley</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , et al.:
          <article-title>OASIS LegalRuleML</article-title>
          .
          <source>In: Proceedings of the 14th International Conference on Arti cial Intelligence and Law</source>
          . p.
          <volume>3</volume>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. van Benthem,
          <string-name>
            <surname>J.:</surname>
          </string-name>
          <article-title>The logic of time: a model-theoretic investigation into the varieties of temporal ontology and temporal discourse</article-title>
          . Kluwe Academic Publishers (
          <year>1983</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Connolly</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>N3logic: A logical framework for the world wide web</article-title>
          .
          <source>Theory and Practice of Logic Programming</source>
          <volume>8</volume>
          (
          <issue>3</issue>
          ),
          <volume>249</volume>
          {
          <fpage>269</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Carroll</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stickler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Named Graphs , Provenance and
          <string-name>
            <given-names>Trust. Digital</given-names>
            <surname>Media</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Chambers</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Classifying temporal relations between events</article-title>
          .
          <source>In: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions</source>
          . pp.
          <volume>173</volume>
          {
          <fpage>176</fpage>
          . No.
          <year>2005</year>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dechter</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meiri</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pearl</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Temporal constraint networks</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>49</volume>
          (
          <issue>1-3</issue>
          ),
          <volume>61</volume>
          {
          <fpage>95</fpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Derczynski</surname>
            ,
            <given-names>L.R.</given-names>
          </string-name>
          :
          <article-title>Determining the Types of Temporal Relations in Discourse</article-title>
          .
          <source>Ph.D. thesis</source>
          , University of She eld (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fujita</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kono</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tanaka</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moto-Oka</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Tokio: Logic Programming Language Based on Temporal Logic and Its Compilation to Prolog</article-title>
          .
          <source>In: Proceedings on 3rd International Conference on Logic Programming</source>
          . pp.
          <volume>695</volume>
          {
          <issue>709</issue>
          (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gerevini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schubert</surname>
          </string-name>
          , L.:
          <article-title>E cient temporal reasoning through timegraphs</article-title>
          .
          <source>In: Proceedings of the 13th International Joint Conference on Arti cal Intelligence</source>
          . pp.
          <volume>648</volume>
          {
          <issue>654</issue>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hurtado</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vaisman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Introducing time into RDF</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <volume>207</volume>
          {
          <fpage>218</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Halpern</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shoham</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>A propositional modal logic of time intervals</article-title>
          .
          <source>Journal of the ACM</source>
          <volume>38</volume>
          (
          <issue>4</issue>
          ),
          <volume>935</volume>
          {
          <fpage>962</fpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ho</surname>
            <given-names>art</given-names>
          </string-name>
          , J.,
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berberich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>194</volume>
          ,
          <fpage>28</fpage>
          {
          <fpage>61</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Hrycej</surname>
          </string-name>
          , T.:
          <article-title>A Temporal extension of Prolog</article-title>
          .
          <source>The Journal of Logic Programming</source>
          <volume>15</volume>
          (
          <issue>1-2</issue>
          ),
          <volume>113</volume>
          {
          <fpage>145</fpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kripke</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Semantical Considerations on Modal Logic</article-title>
          .
          <source>In: Acta Philosophica Fennica</source>
          . vol.
          <volume>16</volume>
          , pp.
          <volume>83</volume>
          {
          <issue>94</issue>
          (
          <year>1963</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zakharyashev</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Temporal description logics: A survey</article-title>
          .
          <source>In: Proceedings of the International Workshop on Temporal Representation and Reasoning</source>
          . pp.
          <volume>3</volume>
          {
          <issue>14</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>McDermott</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>A temporal logic for reasoning about processes and plans</article-title>
          .
          <source>Cognitive Science</source>
          <volume>6</volume>
          (
          <issue>2</issue>
          ),
          <volume>101</volume>
          {
          <fpage>155</fpage>
          (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Moon</surname>
            ,
            <given-names>S.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Fuzzy Branching Temporal Logic</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          ,
          <source>Part B: Cybernetics</source>
          <volume>34</volume>
          (
          <issue>2</issue>
          ),
          <volume>1045</volume>
          {
          <fpage>1055</fpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Nagypal</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>A Fuzzy Model for Representing Uncertain, Subjective, and Vague Temporal Knowledge in Ontologies</article-title>
          . In:
          <article-title>On the Move to Meaningful Internet Systems</article-title>
          . pp.
          <volume>906</volume>
          {
          <issue>923</issue>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Orgun</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>W.:</given-names>
          </string-name>
          <article-title>An Overview of Temporal and Modal Logic Programming</article-title>
          .
          <source>In: Proceedings of the 1st International Conference on Temporal Logic - Lecture Notes in Arti cial Intelligence</source>
          . pp.
          <volume>445</volume>
          {
          <issue>479</issue>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Pani</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhattacharjee</surname>
            ,
            <given-names>G.P.</given-names>
          </string-name>
          :
          <article-title>Temporal representation and reasoning in arti - cial intelligence: A review</article-title>
          .
          <source>Mathematical and Computer Modelling</source>
          <volume>34</volume>
          (
          <issue>1-2</issue>
          ),
          <volume>55</volume>
          {
          <fpage>80</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Pustejovsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bunt</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romary</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>ISO-TIMEML: An International Standard For Semantic Annotation</article-title>
          .
          <source>In: Proceedings of the 7th conference on International Language Resources and Evaluation</source>
          . pp.
          <volume>394</volume>
          {
          <issue>397</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. Strotgen, J.,
          <string-name>
            <surname>Gertz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Multilingual and cross-domain temporal tagging</article-title>
          .
          <source>Language Resources and Evaluation</source>
          <volume>47</volume>
          (
          <issue>2</issue>
          ),
          <volume>269</volume>
          {
          <fpage>298</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Tappolet</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Applied Temporal RDF: E cient Temporal Querying of RDF Data with SPARQL</article-title>
          .
          <source>In: ESWC</source>
          . pp.
          <volume>308</volume>
          {
          <issue>322</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Vila</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwalb</surname>
          </string-name>
          , E.:
          <article-title>A Theory of Time and Temporal Incidence based on Instants and Periods</article-title>
          .
          <source>In: Proceedings of International Workshop on Temporal Representation and Reasoning</source>
          . pp.
          <volume>21</volume>
          {
          <issue>28</issue>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Vila</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>A Survey on temporal reasoning in arti cial intelligence</article-title>
          .
          <source>AI</source>
          Communications
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <volume>4</volume>
          {
          <fpage>28</fpage>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Vila</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoshino</surname>
          </string-name>
          , H.:
          <source>Time in Automated Legal Reasoning. Information and Communications Technology Law</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <volume>1</volume>
          {
          <fpage>30</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fikes</surname>
          </string-name>
          , R.:
          <article-title>A Reusable Ontology for Fluents in OWL</article-title>
          .
          <source>In: Proceedings of 4th FOIS</source>
          . pp.
          <volume>226</volume>
          {
          <issue>236</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hripcsak</surname>
          </string-name>
          , G.:
          <article-title>Temporal reasoning with medical data-A review with emphasis on medical natural language processing</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          <volume>40</volume>
          (
          <issue>2</issue>
          ),
          <volume>183</volume>
          {
          <fpage>202</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fikes</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A reusable time ontology</article-title>
          .
          <source>In: Proceeding of the AAAI Workshop on Ontologies for the Semantic Web</source>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>