Satisfiability for relation-changing logics

Autores
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Martel, Mauricio
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics.We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.
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. Sección Ciencias de la Computación; 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. Sección Ciencias de la Computación; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Martel, Mauricio. Universitat Bremen; Alemania
Materia
DYNAMIC LOGICS
MODAL LOGIC
SATISFIABILITY
UNDECIDABILITY
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/100602
Acceder
id CONICETDig_ed4902c869d678ee52245542745eaefa
oai_identifier_str oai:ri.conicet.gov.ar:11336/100602
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Satisfiability for relation-changing logicsAreces, Carlos EduardoFervari, Raul AlbertoHoffmann, Guillaume EmmanuelMartel, MauricioDYNAMIC LOGICSMODAL LOGICSATISFIABILITYUNDECIDABILITYhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics.We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.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. Sección Ciencias de la Computación; 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. Sección Ciencias de la Computación; ArgentinaFil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Martel, Mauricio. Universitat Bremen; AlemaniaOxford University Press2018-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/100602Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Martel, Mauricio; Satisfiability for relation-changing logics; Oxford University Press; Journal of Logic and Computation; 28; 7; 10-2018; 1443-14700955-792X1465-363XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1093/logcom/exy022info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/logcom/article-abstract/28/7/1443/5069582?redirectedFrom=fulltextinfo: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:45:20Zoai:ri.conicet.gov.ar:11336/100602instacron: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:45:20.489CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Satisfiability for relation-changing logics
title Satisfiability for relation-changing logics
spellingShingle Satisfiability for relation-changing logics
Areces, Carlos Eduardo
DYNAMIC LOGICS
MODAL LOGIC
SATISFIABILITY
UNDECIDABILITY
title_short Satisfiability for relation-changing logics
title_full Satisfiability for relation-changing logics
title_fullStr Satisfiability for relation-changing logics
title_full_unstemmed Satisfiability for relation-changing logics
title_sort Satisfiability for relation-changing logics
dc.creator.none.fl_str_mv Areces, Carlos Eduardo
Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
Martel, Mauricio
author Areces, Carlos Eduardo
author_facet Areces, Carlos Eduardo
Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
Martel, Mauricio
author_role author
author2 Fervari, Raul Alberto
Hoffmann, Guillaume Emmanuel
Martel, Mauricio
author2_role author
author
author
dc.subject.none.fl_str_mv DYNAMIC LOGICS
MODAL LOGIC
SATISFIABILITY
UNDECIDABILITY
topic DYNAMIC LOGICS
MODAL LOGIC
SATISFIABILITY
UNDECIDABILITY
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics.We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.
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. Sección Ciencias de la Computación; 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. Sección Ciencias de la Computación; Argentina
Fil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Martel, Mauricio. Universitat Bremen; Alemania
description Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics.We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.
publishDate 2018
dc.date.none.fl_str_mv 2018-10
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/100602
Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Martel, Mauricio; Satisfiability for relation-changing logics; Oxford University Press; Journal of Logic and Computation; 28; 7; 10-2018; 1443-1470
0955-792X
1465-363X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/100602
identifier_str_mv Areces, Carlos Eduardo; Fervari, Raul Alberto; Hoffmann, Guillaume Emmanuel; Martel, Mauricio; Satisfiability for relation-changing logics; Oxford University Press; Journal of Logic and Computation; 28; 7; 10-2018; 1443-1470
0955-792X
1465-363X
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/logcom/exy022
info:eu-repo/semantics/altIdentifier/url/https://academic.oup.com/logcom/article-abstract/28/7/1443/5069582?redirectedFrom=fulltext
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
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_ 1842268723658883072
score 13.13397

Publicaciones similares