EMTPL and its relation to first order logic

Autores
Cobo, María Laura; Falappa, Marcelo Alejandro
Año de publicación
2004
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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)
Materia
Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/22323
Acceder
id SEDICI_ca978b6e21e22052fc66e51aebfdd2f8
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22323
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling EMTPL and its relation to first order logicCobo, María LauraFalappa, Marcelo AlejandroCiencias Informáticasbase de datosSOFTWARE ENGINEERINGMetricsLogic ProgrammingMetric Temporal LogicTemporal DatabasesTime 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 DatosRed de Universidades con Carreras en Informática (RedUNCI)2004info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/22323enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:27:48Zoai:sedici.unlp.edu.ar:10915/22323Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:27:48.827SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv EMTPL and its relation to first order logic
title EMTPL and its relation to first order logic
spellingShingle EMTPL and its relation to first order logic
Cobo, María Laura
Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
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
dc.creator.none.fl_str_mv Cobo, María Laura
Falappa, Marcelo Alejandro
author Cobo, María Laura
author_facet Cobo, María Laura
Falappa, Marcelo Alejandro
author_role author
author2 Falappa, Marcelo Alejandro
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
topic Ciencias Informáticas
base de datos
SOFTWARE ENGINEERING
Metrics
Logic Programming
Metric Temporal Logic
Temporal Databases
dc.description.none.fl_txt_mv 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)
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.
publishDate 2004
dc.date.none.fl_str_mv 2004
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/22323
url http://sedici.unlp.edu.ar/handle/10915/22323
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260116467875840
score 13.13397

Publicaciones similares