<!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>PENG Light meets the Event Calculus</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>PENG Light</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Centre for Language Technology, Macquarie University Sydney</institution>
          <addr-line>2109 NSW</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
      </contrib-group>
      <fpage>2</fpage>
      <lpage>6</lpage>
      <abstract>
        <p>In this paper I present an extension of the controlled natural language PENG Light that is motivated by the formal properties of the Event Calculus, a narrative-based formal language for events, uents, and the periods for which these uents hold. I show how this extension can be used to express domain-specic axioms in a natural way and sketch how PENG Light and the Event Calculus can be brought together for reasoning about events and time.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>2. The weather is bad. The wind is strong and the sea is rough.
and to make conditional statements such as:
3. If the weather is good then John boards the hydroplane at 14:10 and arrives on
Marettimo Island at 15:35. If the weather is bad then John stays in Trapani and
goes to the Albergo Maccotta.</p>
      <p>
        PENG Light sentences can be translated incrementally during the writing
process via discourse representation structures [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] into TPTP’s rst-order form
syntax [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. A Satchmo-style model builder [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ] is used to generate a nite
model and questions can then be answered over the resulting knowledge base
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], for example questions such as:
4. When does John arrive at the airport? Who gets o the bus in Trapani?
      </p>
      <p>Note that in this case no additional background knowledge is required to
answer these questions since the relevant facts can be looked up in the resulting
knowledge base. The situation, however, is dierent for questions such as:
5. Where is John now? Where is John at 13:30? Why does John stay in Trapani?</p>
      <p>In contrast to a machine, a human observer can easily infer from the text
and his or her commonsense knowledge that John is on the bus at 12:00 but
not anymore at the airport of Palermo at that time and that John is in Trapani
at 13:30 but not anymore on the bus. One possible way of thinking about this
problem is that if an event happens at a specic time point then this event
initiates a state that holds after that time point and continues to hold until
another event terminates this state. Thus, the event of John getting on the bus
at a given point in time initiates that John is on the bus, and the event of
John getting o the bus terminates that John is on the bus. Moreover, using the
information expressed by the conditional statements above, a human observer
can construct an explanation via abduction that tells us why John stays in
Trapani. How can we model this behaviour using a machine?
3</p>
    </sec>
    <sec id="sec-2">
      <title>The Event Calculus</title>
      <p>
        The Event Calculus [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and its variants [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] provide a general framework for
reasoning about time and events, and can help us to solve the problems stated
in the last section. The basic entities of the Event Calculus are events, uents
and time points. Events which occur at a given time point initiate uents (=
properties, states) that hold until they are terminated by other events at a later
time point. I present here a version of the simplied Event Calculus [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] that uses
the following two domain-independent core axioms:
6. holds_at(F,T2)
:
      </p>
      <p>happens(E,T1), initiates(E,F), before(T1,T2), \+ clipped(T1,F,T2).
7. clipped(T1,F,T3)
:</p>
      <p>happens(E,T2), terminates(E,F), before(T1,T2), before(T2,T3).</p>
      <p>The rst rule (6) species that a uent F holds at a time point T2 if an event
E happens at a time point T1 that occurs before T2 and initiates the uent F,
and it cannot be shown that F is clipped (ceases to hold) between the time point
T1 and T2. Note that the negation as failure operator \ + is used to specify a
form of default persistence here. The second rule (7) species that a uent F is
clipped between the time point T1 and T3 if an event E happens at a time point
T2 and terminates F, and T1 occurs before T2 and T2 before T3.</p>
      <p>The relationship between events and uents is usually modeled in the Event
Calculus by a set of domain-specic initiates and terminates clauses whereas
the events are represented as terms and the uents as functions, for example:</p>
      <p>A particular course of events is then represented as a set of ground happens
and event clauses while the before clause keeps track of the temporal ordering:
10. happens(e1,‘10:10’). event(e1,arriving(sk1,sk2)). happens(e2,‘11:30’).
event(e2,leaving(sk3,sk2)). before(‘10:10’,‘11:30’).</p>
      <p>This gives us the required machinery that allows us to infer together with
the formalised information of (1) that John is located at the airport of Palermo
at 11:00 and, let’s say in Trapani at 14:00. In Section 5, we will slightly modify
the above notation in order to integrate the Event Calculus smoothly with the
formal output of the controlled language processor.
4</p>
      <p>
        Speaking about Events and Eects in PENG Light
The discourse in (1) that communicates the relevant events can be expressed
directly in PENG Light but this information needs to be augmented with
additional domain-specic axioms that dene the eects of these events for the Event
Calculus. As explained above, events initiate or terminate uents (or release
them from the commonsense law of inertia [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]); we can specify these additional
domain-specic axioms, for example, in the following way in PENG Light:
11. If X arrives at Y then this event initiates that X is located at Y.
12. If X gets on Y then this event initiates that X is located in Y.
13. If X is located in Y and Y leaves Z then this event terminates
that X is located at Z.
      </p>
      <p>Note that in contrast to (11) and (12), the eect in (13) is not only dependent
on an event but also on a uent that must hold in order to terminate another
uent. In PENG Light we can further restrict the domain and the range of an
event by replacing the variables in the axioms by suitable nominal expressions,
for example:
14. If a person gets on a vehicle then this event initiates that the person is located in
the vehicle.</p>
      <p>
        Note that this leads to additional constraints on the right hand side of the
rules in the Event Calculus, and we need to specify additionally in controlled
language that John is a person and that a bus is a vehicle.
PENG Light sentences are translated via discourse representation structures [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]
into the input language language of a model builder that generates a model
consisting of a number of facts. For example, the two anaphorically related
sentences:
15. John arrives with Flight AZ1777 at the airport of Palermo at 10:10.
16. John gets on a bus at the airport.
result in the following model that distinguishes among other things between
events, objects, temporal and thematic relations:
17. named(sk1,john). theta(e1,theme,sk1). event(e1,arriving).
theta(e1,instrument,sk2). named(sk2,az1777). theta(e1,location,sk3).
object(sk3,airport). associated_with(sk3,sk4). named(sk4,palermo).
theta(e1,time,sk5). timex(sk5,‘10:10’). theta(e2,agent,sk1).
event(e2,getting_on). theta(e2,theme,sk6). object(sk6,bus).
theta(e2,location,sk3). theta(e2,time,sk7). timex(sk7,‘11:15’).
before(‘10:10’,‘11:15’).
      </p>
      <p>Two things are important to note here: rst, these terms are additionally
wrapped by fact/1 (not shown for reasons of space); and second, since the
sentence in (16) does not use an explicit temporal marker, a timestamp ( timex(sk7,
‘11:15’)) is generated in our scenario during the processing of the sentence.</p>
      <p>The following rule then sets up the interface between the facts in (17) and
the domain-independent axioms (6) and (7) of the Event Calculus:
18. happens(E,T) :- event(E,Type), theta(E,time,X), timex(X,T).</p>
      <p>The translation of the domain-specic axioms that relate the events to their
eects results also in a number of rules. For example, the three domain-specic
axioms (11-13) are translated into the following rules:
19. initiates(E,fluent(X,located_at,Y))
:</p>
      <p>event(E,arriving), theta(E,theme,X), theta(E,location,Y).
20. initiates(E,fluent(X,located_in,Y))
:</p>
      <p>event(E,getting_on), theta(E,agent,X), theta(E,theme,Y).
21. terminates(E,fluent(X,located_at,Z))
:event(E,leaving), theta(E,agent,Y), theta(E,theme,Z),
holds_at(fluent(X,located_in,Y),now).</p>
      <p>Given this knowledge, we can now infer with the help of the Event Calculus
that John is in the bus at 11:20 and still in Palermo at that time. This is
because the uents in (19) and (20) that have been initiated by the occurrence
of the events in (17) continue to hold until the occurrence of further events will
terminate them. For example, as soon as the information becomes available that
the bus leaves the airport at 11:30, the conditions in rule (21) will trigger and
terminate the uent that John is located at the airport.</p>
      <p>
        The Event Calculus can be extended in many interesting ways [
        <xref ref-type="bibr" rid="ref7 ref9">7, 9</xref>
        ]. A
particular interesting extension in our context is the combination of the Event Calculus
with a meta-interpreter for abductive reasoning [
        <xref ref-type="bibr" rid="ref1 ref10">1, 10</xref>
        ] in order to nd
explanations for why-questions. Abductive reasoning is inference to the best explanation;
it is reasoning backwards from the consequent to the antecedent and not a valid
form of reasoning, but it can suggest plausible hypotheses. Let us assume that
the information in (3) is available in the knowledge base and that we know
that John stays in Trapani but we would like to know why, then an abductive
meta-interpreter can infer that the weather must be bad.
6
      </p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>In this work I showed how the controlled natural language PENG Light can
be extended in a systematic way to speak about events and their eects. The
controlled natural language is automatically translated into the input language of
a model builder. The generated formal representation can be integrated directly
with the Event Calculus and be used for reasoning about events and time. This
makes PENG Light an interesting specication language for creating more
userfriendly interfaces to knowledge systems in dynamic domains.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Flach</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Simply Logical,
          <article-title>Intelligent Reasoning by Example</article-title>
          . Wiley &amp; Sons, (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Fuchs</surname>
            ,
            <given-names>N.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwertel</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Schwitter</surname>
          </string-name>
          , R.:
          <article-title>Attempto Controlled English Not Just Another Logic Specication Language</article-title>
          .
          <source>In: Logic-Based Program Synthesis and Transformation</source>
          ,
          <source>LOPSTR'98 , LNCS</source>
          , vol.
          <volume>1559</volume>
          , pp.
          <fpage>120</fpage>
          , (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kamp</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>Reyle</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          : From Discourse to Logic:
          <article-title>Introduction to Model-theoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory</article-title>
          . Kluwer Dordrecht, (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kowalski</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sergot</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A Logic-Based Calculus of Events</article-title>
          .
          <source>In: New Generation Computing</source>
          , vol.
          <volume>4</volume>
          , pp.
          <fpage>6794</fpage>
          , (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Loveland</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reed</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          and Wilson,
          <string-name>
            <surname>D.S.:</surname>
          </string-name>
          <article-title>SATCHMORE: SATCHMO with RElevancy</article-title>
          .
          <source>In: Journal of Automated Reasoning</source>
          , vol.
          <volume>14</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>351</lpage>
          , (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Manthey</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bry</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>SATCHMO: A Theorem Prover Implemented in Prolog</article-title>
          .
          <source>In: Proceedings of CADE</source>
          <year>1988</year>
          , pp.
          <fpage>415434</fpage>
          , (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Shanahan</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Some Alternative Formulations of the Event Calculus</article-title>
          . In: A.
          <string-name>
            <surname>C. Kakas</surname>
            and
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Sadri</surname>
          </string-name>
          , (eds.),
          <source>Computational Logic: Logic Programming and Beyond</source>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , LNAI, vol.
          <volume>2408</volume>
          , pp.
          <fpage>452490</fpage>
          , (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mueller</surname>
          </string-name>
          , E.T.:
          <article-title>Commonsense Reasoning</article-title>
          . Morgan Kaufmann Publishers, (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Sadri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kowalski</surname>
          </string-name>
          , R.:
          <article-title>Variants of the Event Calculus</article-title>
          .
          <source>In: Proceedings of the Twelfth International Conference on Logic Programming</source>
          , pp.
          <fpage>6781</fpage>
          , (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Shanahan</surname>
            ,
            <given-names>M.P.:</given-names>
          </string-name>
          <article-title>An Abductive Event Calculus Planner</article-title>
          .
          <source>In: The Journal of Logic Programming</source>
          , vol.
          <volume>44</volume>
          , pp.
          <fpage>207239</fpage>
          , (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sutclie</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v.3.5.0</article-title>
          .
          <source>In: Journal of Automated Reasoning</source>
          , vol.
          <volume>43</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>337</fpage>
          <lpage>362</lpage>
          , (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>White</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Schwitter</surname>
            <given-names>R.</given-names>
          </string-name>
          :
          <source>An Update on PENG Light. In: Proceedings of ALTA</source>
          <year>2009</year>
          , Sydney, Australia, pp.
          <fpage>8088</fpage>
          , (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>