The expressive power of memory logics
- Autores
- Areces, Carlos Eduardo; Figueira, Diego; Figueira, Santiago; Mera, Sergio Fernando
- Año de publicación
- 2011
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ(↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain. This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic script K sign and ℋℒ(↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized.
Fil: Areces, Carlos Eduardo. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueira, Diego. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Mera, Sergio Fernando. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina - Materia
-
Memory Logics
Expressive Power
Decidability
Model Theory - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/68257
Ver los metadatos del registro completo
id |
CONICETDig_a7392778c3baab3dab32fe004c2b5a6e |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/68257 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
The expressive power of memory logicsAreces, Carlos EduardoFigueira, DiegoFigueira, SantiagoMera, Sergio FernandoMemory LogicsExpressive PowerDecidabilityModel Theoryhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ(↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain. This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic script K sign and ℋℒ(↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized.Fil: Areces, Carlos Eduardo. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Figueira, Diego. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Mera, Sergio Fernando. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaCambridge University Press2011-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/68257Areces, Carlos Eduardo; Figueira, Diego; Figueira, Santiago; Mera, Sergio Fernando; The expressive power of memory logics; Cambridge University Press; Review of Symbolic Logic; 4; 2; 6-2011; 290-3181755-0203CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1017/S1755020310000389info:eu-repo/semantics/altIdentifier/url/https://www.cambridge.org/core/journals/review-of-symbolic-logic/article/expressive-power-of-memory-logics/021B058177CA9738B490C1F373D12CA2info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:49:46Zoai:ri.conicet.gov.ar:11336/68257instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:49:46.606CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
The expressive power of memory logics |
title |
The expressive power of memory logics |
spellingShingle |
The expressive power of memory logics Areces, Carlos Eduardo Memory Logics Expressive Power Decidability Model Theory |
title_short |
The expressive power of memory logics |
title_full |
The expressive power of memory logics |
title_fullStr |
The expressive power of memory logics |
title_full_unstemmed |
The expressive power of memory logics |
title_sort |
The expressive power of memory logics |
dc.creator.none.fl_str_mv |
Areces, Carlos Eduardo Figueira, Diego Figueira, Santiago Mera, Sergio Fernando |
author |
Areces, Carlos Eduardo |
author_facet |
Areces, Carlos Eduardo Figueira, Diego Figueira, Santiago Mera, Sergio Fernando |
author_role |
author |
author2 |
Figueira, Diego Figueira, Santiago Mera, Sergio Fernando |
author2_role |
author author author |
dc.subject.none.fl_str_mv |
Memory Logics Expressive Power Decidability Model Theory |
topic |
Memory Logics Expressive Power Decidability Model Theory |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ(↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain. This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic script K sign and ℋℒ(↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized. Fil: Areces, Carlos Eduardo. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Figueira, Diego. Institut National de Recherche en Informatique et en Automatique; Francia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Mera, Sergio Fernando. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina |
description |
We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ(↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain. This work focuses in the case where the memory is a set, and we can test whether the current node belongs to the set or not. We prove that, in terms of expressive power, the memory logics we discuss here lie between the basic modal logic script K sign and ℋℒ(↓). We show that the satisfiability problem of most of the logics we cover is undecidable. The only logic with a decidable satisfiability problem is obtained by imposing strong constraints on which elements can be memorized. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-06 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/68257 Areces, Carlos Eduardo; Figueira, Diego; Figueira, Santiago; Mera, Sergio Fernando; The expressive power of memory logics; Cambridge University Press; Review of Symbolic Logic; 4; 2; 6-2011; 290-318 1755-0203 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/68257 |
identifier_str_mv |
Areces, Carlos Eduardo; Figueira, Diego; Figueira, Santiago; Mera, Sergio Fernando; The expressive power of memory logics; Cambridge University Press; Review of Symbolic Logic; 4; 2; 6-2011; 290-318 1755-0203 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1017/S1755020310000389 info:eu-repo/semantics/altIdentifier/url/https://www.cambridge.org/core/journals/review-of-symbolic-logic/article/expressive-power-of-memory-logics/021B058177CA9738B490C1F373D12CA2 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Cambridge University Press |
publisher.none.fl_str_mv |
Cambridge University Press |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1842268993427079168 |
score |
13.13397 |