Observing events and situations in time.
Events and situations are represented by strings of temporally ordered observations, on the basis of which the events and situations are recognized. Allen’s basic interval relations are derived from superposing strings that mark interval boundaries, and Kamp’s event structures are constructed as pro...
| Publicado en: | Linguistics & Philosophy Vol. 30; no. 5; pp. 527 - 551 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Oct2007
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=32202191&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 32202191 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 01650157 OJI jtl: Linguistics & Philosophy issn: 01650157 maglogo: N pubinfo: dt: Oct2007 vid: 30 iid: 5 pid: 237 pub: Springer Nature artinfo: ui: 32202191 10.1007/s10988-008-9026-1 ppf: 527 ppct: 24 formats: fmt: @attributes: type: P size: 406KB tig: atl: Observing events and situations in time. aug: au: Fernando, Tim affil: Computer Science Department , Trinity College , Dublin 2 Ireland su: Temporal automata Proposition (Logic) Machine theory Time Axioms Structural analysis (Linguistics) sug: subj: Temporal automata Proposition (Logic) Machine theory Time Axioms Structural analysis (Linguistics) keyword: Event structure ab: Events and situations are represented by strings of temporally ordered observations, on the basis of which the events and situations are recognized. Allen’s basic interval relations are derived from superposing strings that mark interval boundaries, and Kamp’s event structures are constructed as projective limits of strings. Observations are generalized to temporal propositions, leading to event-types that classify event-instances. Working with sets of strings built from temporal propositions, we obtain natural notions of bounded entailment from set inclusions. These inclusions are decidable if the sets are accepted by finite automata. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Linguistics & Philosophy is a copyright of Springer, 2007. All Rights Reserved. item: Linguistics & Philosophy holder: Springer Nature dt: @attributes: year: 2007 holdings: @attributes: islocal: N |
|---|