Situations in LTL as strings

Authors:
Tim Fernando
Affiliations:
Computer Science Department, Trinity College, Dublin 2, Ireland
Venue:
Information and Computation
Year:
2009

Citing 7
Cited 3

Topology via logic

Topology via logic
Type-theoretical grammar

Type-theoretical grammar
Model checking

Model checking
The situations we talk about

Logic-based artificial intelligence
A Finite-state Approach to Events in Natural Language Semantics

Journal of Logic and Computation
Records and Record Types in Semantic Theory

Journal of Logic and Computation
Finite-State temporal projection

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Frames in formal semantics

IceTAL'10 Proceedings of the 7th international conference on Advances in natural language processing
Temporal propositions as vague predicates

Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
Regular relations for temporal propositions

Natural Language Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Situations serving as worlds as well as events in linguistic semantics are formulated as strings recording observations over discrete time. This formulation is applied to a linear temporal logic, in line with L. Schubert's distinction between described and characterized situations. The distinction is developed topologically and computationally, and linked to the opposition between truth-conditional and proof-conditional semantics. For a finitary handle on quantification, strings are associated with situations not only on the basis of observation but also through derivation and constraint satisfaction. The constraints specified lead to an implementation simpler than the derivations given.