Temporal prepositions and their logic

作者:

摘要

A fragment of English featuring temporal prepositions and the order-denoting adjectives first and last is defined by means of a context-free grammar. The phrase-structures which this grammar assigns to the sentences it recognizes are viewed as formulas of an interval temporal logic, whose satisfaction-conditions faithfully represent the meanings of the corresponding English sentences. It is shown that the satisfiability problem for this logic is NEXPTIME-complete. The computational complexity of determining logical relationships between English sentences featuring the temporal constructions in question is thus established.

论文关键词:Natural language,Temporal prepositions,Interval temporal logic,Computational complexity

论文评审过程:Received 20 April 2004, Accepted 9 April 2005, Available online 1 June 2005.

论文官网地址:https://doi.org/10.1016/j.artint.2005.04.003