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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cobo, María Laura, Falappa, Marcelo Alejandro
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22323
Aporte de:
id I19-R120-10915-22323
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
spellingShingle Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
Cobo, María Laura
Falappa, Marcelo Alejandro
EMTPL and its relation to first order logic
topic_facet Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
description 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.
format Objeto de conferencia
Objeto de conferencia
author Cobo, María Laura
Falappa, Marcelo Alejandro
author_facet Cobo, María Laura
Falappa, Marcelo Alejandro
author_sort Cobo, María Laura
title EMTPL and its relation to first order logic
title_short EMTPL and its relation to first order logic
title_full EMTPL and its relation to first order logic
title_fullStr EMTPL and its relation to first order logic
title_full_unstemmed EMTPL and its relation to first order logic
title_sort emtpl and its relation to first order logic
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22323
work_keys_str_mv AT cobomarialaura emtplanditsrelationtofirstorderlogic
AT falappamarceloalejandro emtplanditsrelationtofirstorderlogic
bdutipo_str Repositorios
_version_ 1764820465586536450