- Abstract:
-
This paper investigates the computational complexity of reasoning with English sentences featuring temporal prepositions, temporal subordinating conjunctions and the order-denoting adjectives `first' and `last'. A fragment of English featuring these constructions, called TPE, is defined by means of a context-free grammar. The phrase-structures which this grammar assigns to the sentences it recognizes can be viewed as formulas of an interval temporal logic, called TPL, and given intuitively correct semantics. It is shown that the satisfiability problem for TPL is NEXPTIME-complete.
- Copyright:
- 2004 by The University of Edinburgh. All Rights Reserved
- Links To Paper
- No links available
- Bibtex format
- @Misc{EDI-INF-RR-0194,
- author = {
Ian Pratt-Hartmann
},
- title = {Temporal Prepositions and their Logic},
- year = 2004,
- month = {Jan},
- }
|
