Handbook of theoretical computer science (vol. B)
Temporal reasoning based on semi-intervals
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
A Finite-state Approach to Events in Natural Language Semantics
Journal of Logic and Computation
Representing and Combining Calendar Information by Using Finite-State Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Chronoscopes: a theory of underspecified temporal representations
Proceedings of the 2005 international conference on Annotating, extracting and reasoning about time and events
Regular relations for temporal propositions
Natural Language Engineering
Steedman's temporality proposal and finite automata
AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning
| Hi-index | 0.00 |
Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and notions of partiality within and across such levels.