Undecidability of Relation-Changing Modal Logics

C. Areces, R. Fervari, G. Hoffmann, and M. Martel. Undecidability of Relation-Changing Modal Logics. In Proceedings of Workshop DaLí - Dynamic Logic: new trends and applications, Brasília, Brazil, September 2017.

Download: [pdf] 

Abstract:

Relation-changing modal logics are extensions of the basic modal logic that allow to change the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add and swap edges in the model, both locally and globally. We investigate the satisfiability problem of these logics. We define satisfiability-preserving translations from an undecidable memory logic to relation-changing modal logics. This way we show that their satisfiability problems are undecidable.

BibTeX: (download)

@INCOLLECTION{arec:17,
  author = {C. Areces and R. Fervari and G. Hoffmann and M. Martel},
  title = {Undecidability of Relation-Changing Modal Logics},
  booktitle = {Proceedings of Workshop DaLí - Dynamic Logic: new trends and applications},
  year = {2017},
  address = {Brasília, Brazil},
  month = {September},
  abstract = {Relation-changing modal logics are extensions of the basic modal logic
	that allow to change the accessibility relation of a model during
	the evaluation of a formula. In particular, they are equipped with
	dynamic modalities that are able to delete, add and swap edges in
	the model, both locally and globally. We investigate the satisfiability
	problem of these logics. We define satisfiability-preserving translations
	from an undecidable memory logic to relation-changing modal logics.
	This way we show that their satisfiability problems are undecidable.},
  owner = {areces},
  timestamp = {2017.12.04}
}

Generated by bib2html.pl (written by Patrick Riley) on Mon Dec 04, 2017 20:59:00