EMTPL and its relation to first order logic

Time and change are notions that seems unavoidable in some areas of work and investigation, languages that can deal with these notions are necessary. At the same time, methods for a proper time handling are quite complex, mainly because problem’s complexity and variety of solutions. Between the languages developed to cover these expectations, under a specific view of time, are [Cobo and Augusto, 1999a] EMTLP and a metric temporal logic’s fragment, bounded universal Horn formulae analyzed by Brzoska [Brzoska, 1998]. Although both of them performed metric temporal programming, they face this fact from different perspectives. In this work we are going to try a comparison between them after a short overview over each. In this first stage we present a way of representing EMTPL’s in first order logic using Brzoska’s approximation as a bridge, and we also compare some aspects of both programming languages. Eje: I - Workshop de Ingeniería de Software y Base de Datos Red de Universidades con Carreras en Informática (RedUNCI)