Relation-changing modal operators

Autores
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we investigate relation-changing modal logics as fragments of classical logics. Then, we use the new framework to get a suitable notion of bisimulation for the logics introduced, and we investigate their expressive power. Finally, we show that the complexity of the model checking problem for the particular operators introduced is PSpace-complete, and we study two subproblems of model checking: formula complexity and program complexity.
Fil: Areces, Carlos Eduardo. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Fervari, Raul Alberto. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
COMPLEXITY
DYNAMIC LOGICS
EXPRESSIVITY
MODAL LOGIC
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/37856
Acceder
id CONICETDig_3c4c00b6baf6bd6b401fc84d3b3e65b3
oai_identifier_str oai:ri.conicet.gov.ar:11336/37856
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Relation-changing modal operatorsAreces, Carlos EduardoFervari, Raul AlbertoHoffmann, Guillaume EmmanuelCOMPLEXITYDYNAMIC LOGICSEXPRESSIVITYMODAL LOGIChttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we investigate relation-changing modal logics as fragments of classical logics. Then, we use the new framework to get a suitable notion of bisimulation for the logics introduced, and we investigate their expressive power. Finally, we show that the complexity of the model checking problem for the particular operators introduced is PSpace-complete, and we study two subproblems of model checking: formula complexity and program complexity.Fil: Areces, Carlos Eduardo. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Fervari, Raul Alberto. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaOxford University Press2015-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/37856Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Relation-changing modal operators; Oxford University Press; Logic Journal of the IGPL (print); 23; 4; 5-2015; 601-1271367-0751CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1093/jigpal/jzv020info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/jigpal/article/23/4/601/690884info: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:58:39Zoai:ri.conicet.gov.ar:11336/37856instacron: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:58:39.376CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Relation-changing modal operators
title Relation-changing modal operators
spellingShingle Relation-changing modal operators
Areces, Carlos Eduardo
COMPLEXITY
DYNAMIC LOGICS
EXPRESSIVITY
MODAL LOGIC
title_short Relation-changing modal operators
title_full Relation-changing modal operators
title_fullStr Relation-changing modal operators
title_full_unstemmed Relation-changing modal operators
title_sort Relation-changing modal operators
dc.creator.none.fl_str_mv Areces, Carlos Eduardo
Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
author Areces, Carlos Eduardo
author_facet Areces, Carlos Eduardo
Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
author_role author
author2 Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
author2_role author
author
dc.subject.none.fl_str_mv COMPLEXITY
DYNAMIC LOGICS
EXPRESSIVITY
MODAL LOGIC
topic COMPLEXITY
DYNAMIC LOGICS
EXPRESSIVITY
MODAL LOGIC
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 study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we investigate relation-changing modal logics as fragments of classical logics. Then, we use the new framework to get a suitable notion of bisimulation for the logics introduced, and we investigate their expressive power. Finally, we show that the complexity of the model checking problem for the particular operators introduced is PSpace-complete, and we study two subproblems of model checking: formula complexity and program complexity.
Fil: Areces, Carlos Eduardo. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Fervari, Raul Alberto. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or swap an edge between pairs of elements of the domain. We define a generic framework to characterize this kind of operations. First, we investigate relation-changing modal logics as fragments of classical logics. Then, we use the new framework to get a suitable notion of bisimulation for the logics introduced, and we investigate their expressive power. Finally, we show that the complexity of the model checking problem for the particular operators introduced is PSpace-complete, and we study two subproblems of model checking: formula complexity and program complexity.
publishDate 2015
dc.date.none.fl_str_mv 2015-05
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/37856
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Relation-changing modal operators; Oxford University Press; Logic Journal of the IGPL (print); 23; 4; 5-2015; 601-127
1367-0751
CONICET Digital
CONICET
url http://hdl.handle.net/11336/37856
identifier_str_mv Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Relation-changing modal operators; Oxford University Press; Logic Journal of the IGPL (print); 23; 4; 5-2015; 601-127
1367-0751
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.1093/jigpal/jzv020
info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/jigpal/article/23/4/601/690884
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
dc.publisher.none.fl_str_mv Oxford University Press
publisher.none.fl_str_mv Oxford 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_ 1842269533087203328
score 13.13397

Publicaciones similares