Affordable Access

Publisher Website

Temporal prepositions and their logic

Authors
Journal
Artificial Intelligence
0004-3702
Publisher
Elsevier
Publication Date
Volume
166
Identifiers
DOI: 10.1016/j.artint.2005.04.003
Keywords
  • Natural Language
  • Temporal Prepositions
  • Interval Temporal Logic
  • Computational Complexity
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract 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.

There are no comments yet on this publication. Be the first to share your thoughts.