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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Areces, C.: Hybrid logics: the old and the new. In: Proceedings of LogKCA 2007, pp. 15–29 (2007)
Areces, C., Fervari, R., Hoffmann, G.: Moving arrows and four model checking results. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 142–153. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32621-9_11
Areces, C., Fervari, R., Hoffmann, G.: Tableaux for relation-changing modal logics. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 263–278. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40885-4_19
Areces, C., Fervari, R., Hoffmann, G.: Swap logic. Logic J. IGPL 22(2), 309–332 (2014)
Areces, C., Fervari, R., Hoffmann, G.: Relation-changing modal operators. Logic J. IGPL 23(4), 601–627 (2015)
Areces, C., Fervari, R., Hoffmann, G., Martel, M.: Relation-changing logics as fragments of hybrid logics. In: Cantone, D., Delzanno, G. (eds.) Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Italy. EPTCS, vol. 226, pp. 16–29 (2016)
Areces, C., Figueira, D., Figueira, S., Mera, S.: The expressive power of memory logics. Rev. Symb. Logic 4(2), 290–318 (2011)
Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logic, pp. 821–868. Elsevier (2007)
Areces, C., van Ditmarsch, H., Fervari, R., Schwarzentruber, F.: Logics with copy and remove. In: Kohlenbach, U., Barceló, P., de Queiroz, R. (eds.) WoLLIC 2014. LNCS, vol. 8652, pp. 51–65. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44145-9_4
Areces, C., van Ditmarsch, H., Fervari, R., Schwarzentruber, F.: The modal logic of copy and remove. To Appear in Information and Computation (2015). Special Issue of WoLLIC 2014
Aucher, G., Schwarzentruber, F.: On the complexity of dynamic epistemic logic. In: Proceedings of TARK 2013, Chennai, India, January 2013
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, New York (2001)
Blackburn, P., Seligman, J.: Hybrid languages. J. Logic Lang. Inf. 4(3), 251–272 (1995)
Blackburn, P., van Benthem, J.: Modal logic: a semantic perspective. In: Handbook of Modal Logic, pp. 1–84. Elsevier (2007)
Fervari, R.: Relation-Changing Modal Logics. Ph.D. thesis, Universidad Nacional de Córdoba, Argentina (2014)
Löding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 302–313. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-24597-1_26
Lutz, C.: Complexity and succinctness of public announcement logic. In: Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2006, New York, NY, USA, pp. 137–143 (2006)
Marx, M.: Narcissists, stepmothers and spies. In: Proceedings of DL 2002, vol. 53. CEUR (2002)
Mera, S.: Modal memory logics. Ph.D. thesis, Université Henri Poincaré, Nancy, France and Universidad de Buenos Aires, Argentina (2009)
Rohde, P.: On games and logics over dynamically changing structures. Ph.D. thesis, RWTH Aachen (2006)
Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol. 2605, pp. 268–276. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-32254-2_16
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-5839-4
Acknowledgements
This work was partially supported by grant ANPCyT-PICT-2013-2011, STIC-AmSud “Foundations of Graph Structured Data (FoG)”, SeCyT-UNC, the Laboratoire International Associé “INFINIS”, and the EU Horizon 2020 research and innovation programme under the Marie Skodowska-Curie grant No. 690974, project MIREL: MIning and REasoning with Legal texts.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Areces, C., Fervari, R., Hoffmann, G., Martel, M. (2018). Undecidability of Relation-Changing Modal Logics. In: Madeira, A., Benevides, M. (eds) Dynamic Logic. New Trends and Applications. DALI 2017. Lecture Notes in Computer Science(), vol 10669. Springer, Cham. https://doi.org/10.1007/978-3-319-73579-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-73579-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73578-8
Online ISBN: 978-3-319-73579-5
eBook Packages: Computer ScienceComputer Science (R0)