Handbook of theoretical computer science (vol. B)
Dynamic Logic
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Information and Computation
TIWTE '11 Proceedings of the TextInfer 2011 Workshop on Textual Entailment
Finite-state representations embodying temporal relations
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
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 |
Relations computed by finite-state transducers are applied to interpret temporal propositions in terms of strings representing finite contexts or situations. Carnap???Montague intensions mapping indices to extensions are reformulated as relations between strings that can serve as indices and extensions alike. Strings are related according to information content, temporal span and granularity, the bounds on which reflect the partiality of natural language statements. That partiality shapes not only strings-as-extensions (indicating what statements are about) but also strings-as-indices (underlying truth conditions).