|
Abstract
|
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.
|
|
Keywords
|
No keywords specified (fix it)
|
|
Categories
|
|
|
Options
|
|
| |
|
Download options
Similar books and articles
Analytics
My notes
Discussion
