EMTPL and its relation to first order logic

MARÍA LAURA COBO; MARCELO A. FALAPPA

Buenos Aires, Argentina

Congreso; X Congreso Argentino de Ciencias de la Computación, CACIC'2004; 2004

Universidad Nacional de La Matanza

Time and change are notions that seems unavoidable in some areas of work andinvestigation, languages that can deal with these notions are necessary. At the sametime, methods for a proper time handling are quite complex, mainly because problem’scomplexity and variety of solutions. Between the languages developed to coverthese expectations, under a specific view of time, are [Cobo and Augusto, 1999a]EMTLP and a metric temporal logic’s fragment, bounded universal Horn formulaeanalyzed by Brzoska [Brzoska, 1998]. Although both of them performed metrictemporal programming, they face this fact from different perspectives. In this workwe are going to try a comparison between them after a short overview over each. Inthis first stage we present a way of representing EMTPL’s in first order logic usingBrzoska’s approximation as a bridge, and we also compare some aspects of bothprogramming languages.