2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33220Previous work in the context of natural language querying of temporal databases has established a method to map automatically from a large subset of English time-related questions to suitable expressions of a temporal logic-like language, called TOP. An algorithm to translate from TOP to the TSQL2 temporal database language has also been defined. This paper shows how TOP expressions could be translated into a simpler logic-like language, called BOT. BOT is very close to traditional first-order predicate logic (FOPL), and hence existing methods to manipulate FOPL expressions can be exploited to interface to time-sensitive applications other than TSQL2 databases, maintaining the existing English-to-TOP mapping.15 pages. To appear in the Proceedings of the 12th International Symposium on Languages for Intensional Programming, Athens, Greece, 1999Computation and LanguageI.2.7; F.4.1; H.5.2text