Swap logic

Autores
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We investigate dynamic modal operators that can changethe model during evaluation. We define the logicSLby extending thebasic modal language with the♦modality, which is a diamond operatorthat in addition has the ability to invert pairs of related elements in thedomain while traversing an edge of the accessibility relation.SLis very expressive: it fails to have the finite and the tree model prop-erty. We show thatSLis equivalent to a fragment of first-order logic byproviding a satisfiability preserving translation. In addition, we providean equivalence preserving translation fromSLto the hybrid logicH(:,↓).We also define a suitable notion of bisimulation forSLand investigate itsexpressive power, showing that it lies strictly between the basic modallogic andH(:,↓). We finally show that its model checking problem isPSpace-complete and its satisfiability problem is undecidable.
Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
Fil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
Materia
Modal Logic
Dynamic Logics
Expressivity
Complexity
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/33973
Acceder
id CONICETDig_f1da66bad15b9ce94259c76b8c7ea836
oai_identifier_str oai:ri.conicet.gov.ar:11336/33973
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Swap logicAreces, Carlos EduardoFervari, Raul AlbertoHoffmann, Guillaume EmmanuelModal LogicDynamic LogicsExpressivityComplexityhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We investigate dynamic modal operators that can changethe model during evaluation. We define the logicSLby extending thebasic modal language with the♦modality, which is a diamond operatorthat in addition has the ability to invert pairs of related elements in thedomain while traversing an edge of the accessibility relation.SLis very expressive: it fails to have the finite and the tree model prop-erty. We show thatSLis equivalent to a fragment of first-order logic byproviding a satisfiability preserving translation. In addition, we providean equivalence preserving translation fromSLto the hybrid logicH(:,↓).We also define a suitable notion of bisimulation forSLand investigate itsexpressive power, showing that it lies strictly between the basic modallogic andH(:,↓). We finally show that its model checking problem isPSpace-complete and its satisfiability problem is undecidable.Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Hoffmann, Guillaume Emmanuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaOxford University Press2014-03info: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/33973Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Swap logic; Oxford University Press; Logic Journal Of The Igpl (print); 22; 2; 3-2014; 309-3321367-0751CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1093/jigpal/jzt030info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/jigpal/article-abstract/22/2/309/702907info: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:43:18Zoai:ri.conicet.gov.ar:11336/33973instacron: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:43:18.754CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Swap logic
title Swap logic
spellingShingle Swap logic
Areces, Carlos Eduardo
Modal Logic
Dynamic Logics
Expressivity
Complexity
title_short Swap logic
title_full Swap logic
title_fullStr Swap logic
title_full_unstemmed Swap logic
title_sort Swap logic
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 Modal Logic
Dynamic Logics
Expressivity
Complexity
topic Modal Logic
Dynamic Logics
Expressivity
Complexity
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 dynamic modal operators that can changethe model during evaluation. We define the logicSLby extending thebasic modal language with the♦modality, which is a diamond operatorthat in addition has the ability to invert pairs of related elements in thedomain while traversing an edge of the accessibility relation.SLis very expressive: it fails to have the finite and the tree model prop-erty. We show thatSLis equivalent to a fragment of first-order logic byproviding a satisfiability preserving translation. In addition, we providean equivalence preserving translation fromSLto the hybrid logicH(:,↓).We also define a suitable notion of bisimulation forSLand investigate itsexpressive power, showing that it lies strictly between the basic modallogic andH(:,↓). We finally show that its model checking problem isPSpace-complete and its satisfiability problem is undecidable.
Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
Fil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina
description We investigate dynamic modal operators that can changethe model during evaluation. We define the logicSLby extending thebasic modal language with the♦modality, which is a diamond operatorthat in addition has the ability to invert pairs of related elements in thedomain while traversing an edge of the accessibility relation.SLis very expressive: it fails to have the finite and the tree model prop-erty. We show thatSLis equivalent to a fragment of first-order logic byproviding a satisfiability preserving translation. In addition, we providean equivalence preserving translation fromSLto the hybrid logicH(:,↓).We also define a suitable notion of bisimulation forSLand investigate itsexpressive power, showing that it lies strictly between the basic modallogic andH(:,↓). We finally show that its model checking problem isPSpace-complete and its satisfiability problem is undecidable.
publishDate 2014
dc.date.none.fl_str_mv 2014-03
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/33973
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Swap logic; Oxford University Press; Logic Journal Of The Igpl (print); 22; 2; 3-2014; 309-332
1367-0751
CONICET Digital
CONICET
url http://hdl.handle.net/11336/33973
identifier_str_mv Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Swap logic; Oxford University Press; Logic Journal Of The Igpl (print); 22; 2; 3-2014; 309-332
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/jzt030
info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/jigpal/article-abstract/22/2/309/702907
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 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_ 1842268592592125952
score 13.13397

Publicaciones similares