Regular relations for temporal propositions
-
Published:2011-03-21
Issue:2
Volume:17
Page:163-184
-
ISSN:1351-3249
-
Container-title:Natural Language Engineering
-
language:en
-
Short-container-title:Nat. Lang. Eng.
Abstract
AbstractRelations 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).
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics,Software
Reference24 articles.
1. 17 Automata-theoretic techniques for temporal reasoning
2. Karttunen L. 2005 The Yale Shooting Problem. http://www.stanford.edu/~laurik/fsmbook/examples/YaleShooting.html
3. Dynamic Logic
4. Constructing situations and time.;Fernando;Journal of Philosophical Logic,2010
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献