dc.contributor.author | FERNANDO, RAFAEL TIMOTHY | |
dc.date.accessioned | 2012-04-02T09:17:31Z | |
dc.date.available | 2012-04-02T09:17:31Z | |
dc.date.issued | 2011 | |
dc.date.submitted | 2011 | en |
dc.identifier.citation | Tim Fernando, Regular relations for temporal propositions, Natural Language Engineering, 17, 2, 2011, 163 - 184 | en |
dc.identifier.other | Y | |
dc.description | PUBLISHED | en |
dc.description.abstract | 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). | en |
dc.format.extent | 163 | en |
dc.format.extent | 184 | en |
dc.language.iso | en | en |
dc.publisher | Cambridge University Press | en |
dc.relation.ispartofseries | Natural Language Engineering; | |
dc.relation.ispartofseries | 17; | |
dc.relation.ispartofseries | 2; | |
dc.rights | Y | en |
dc.subject | Computer Science and Engineering | en |
dc.subject | Linear temporal logic | en |
dc.title | Regular relations for temporal propositions | en |
dc.type | Journal Article | en |
dc.type.supercollection | scholarly_publications | en |
dc.type.supercollection | refereed_publications | en |
dc.identifier.peoplefinderurl | http://people.tcd.ie/tfernand | |
dc.identifier.rssinternalid | 71882 | |
dc.identifier.rssuri | http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8225154&fulltextType=RA&fileId=S135132491100009X | en |
dc.identifier.uri | http://hdl.handle.net/2262/62901 | |