File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/abstr/86/c86-1083_abstr.xml
Size: 5,932 bytes
Last Modified: 2025-10-06 13:46:19
<?xml version="1.0" standalone="yes"?> <Paper uid="C86-1083"> <Title>TEMPORAL RELATIONS IN TEXTS AND TIME LOGICAL INFERENCES</Title> <Section position="1" start_page="0" end_page="350" type="abstr"> <SectionTitle> TEMPORAL RELATIONS IN TEXTS AND TIME LOGICAL INFERENCES </SectionTitle> <Paragraph position="0"> Abstract: A calculus is presented which allows an efficient treatment of the following components: Tenses, temporal conjunctions, temporal adverbials (of &quot;definite&quot; type), temporal quantifications and phases.</Paragraph> <Paragraph position="1"> The phases are a means for structuring the set of time-points t where a certain proposition is valid. For one proposition there may exist several &quot;phase&quot;-perspectives. The calculus has integrative properties, i. e.</Paragraph> <Paragraph position="2"> all five components are represented by the same formal means. This renders possible a rather easy combination of all informations and conditions coming from the aforesaid components.</Paragraph> <Paragraph position="3"> I. Prerequisits We assume that propositions are replaced by phase-sets: A proposition R is something which is true or false at each point t of the time axis U:</Paragraph> <Paragraph position="5"> A phase is an interval (span or moment) p on the time axis, which a truth value (denoted by q(p)) is assigned to: q(p) = T: p is an affirmative (main-)phase. q(p) = F: p is a declining (secondary) phase. A phase-set P is a pair \[P~,q\]: P~ is a set of intervals p and q is an evaluation function assigning a truth value to each p6 P~. The substitution of propositions R by phase-sets P is not unequivocal, but also not arbitrary. Some necessary conditions for the relationship between R and its &quot;surrogate&quot; P have been introduced and discussed elsewhere (Kunze 1986). One essential point is that the simple &quot;moment logic&quot; becomes an &quot;interval logic&quot;. This is also connected with questions as expressed by the different definitions of HOLD, OCCUR and OCCURING in Allen 1984.</Paragraph> <Paragraph position="6"> Another fact connected with phases is the unsymmetry in the case of a negation: (I) The museum is open today.</Paragraph> <Paragraph position="7"> + The museum is open all day today.</Paragraph> <Paragraph position="8"> (2) The museum is closed today.</Paragraph> <Paragraph position="9"> = The museum is closed all day today.</Paragraph> <Paragraph position="10"> The proposition R is supposed to be fixed and given. P is considered as variable and provides a formal counterpart of different phase-perspectives for a certain proposition. The German sentence (3) Thomas raucht.</Paragraph> <Paragraph position="11"> has at least two of them (and consequently two meanings): &quot;Thomas is a smoker&quot; and &quot;Thomas is smoking&quot;. Furthermore the use of phases enables us to consider some parts of T(R) as unimportant, accidental or exceptional. These parts form declining phases of R. The affirmative phases of R need not be disjunct, and they need not be contained in T(R). It is also possible to introduce nested phases, so that rather complicated courses may be rcpresented.</Paragraph> <Paragraph position="12"> 2. Some formal definitions</Paragraph> <Paragraph position="14"> sets with P~ : P~. Then PI and P2 may be connected by means of sentential logic: For any functor &quot;o&quot; (e. g. &quot;... and ...&quot; and &quot;if , then . &quot;) ....... one defines</Paragraph> <Paragraph position="16"> Phase-operators connect arbitrary phasesets. As an example we take the phase-</Paragraph> <Paragraph position="18"> one gets the definition of P = PER(PI,P2) .</Paragraph> <Paragraph position="20"> The important point is that these relationships between PI and P2 are not represented by a Yes-No-decision, but again by a phase-set P: OCC(PI,P2) selects from the T-phases of the first argument those p for which the characteristic condition (= there is a P2 with q2(P2 ) = T and p ~ P2 % @) is fulfilled. The phase-operator OCC is not the same thing as OCCUR or OCCURING in Allen 1984.</Paragraph> <Paragraph position="21"> There are at least three differences: OCCUR is a Yes-No-predicate, has as first argument an event and as second an intervalland the arguments are no sets as in our case. It makes at any rate difficulties to generalize such a Yes-No-property for sets as arguments. This is one reason for our definitions. More important is that e. g. OCC(PI,P 2) may be used as argument in another phase-operator.</Paragraph> <Paragraph position="22"> This enables us to express quite easily the essential time relation in &quot;In July there are evening-planes on Tuesday and Friday.&quot;.</Paragraph> <Paragraph position="23"> One needs some other operations: Given P = \[P~,q\], then alt(P) contains exactly those phases which one gets by joining all phases of P which are not seperated from each other and have the same q-value (inductively understood).</Paragraph> <Paragraph position="24"> If one designates by U deg the phase-set consisting only of U as interval (with q(U) : T) , then alt(P) = U O means that the union of all T-phases of P covers the time axis U, i. e. &quot;P is always true&quot;. In sectdeg I. we already sketched how to represent propositions R by phase-sets P.</Paragraph> <Paragraph position="25"> We write P = <R>. Now we have to explain the same for temporal adverbials: <tuesday> is a phase--set P, whose intervals p are the days, and exactly the Tuesdays have the q-value T. In <day> all intervals (: day) have the q-value T. <1982> is a phase-set with years as intervals, but only one (:&quot;1982&quot;) has the q-value T. Obviously x<tuesday> is a single unspecified Tuesday, x<day> an unspecified day.</Paragraph> </Section> class="xml-element"></Paper>