Switch to: References

Citations of:

A Composable Language for Action Models

In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10: Papers From the Tenth Aiml Conference, Held in Groningen, the Netherlands, August 2014. London, England: CSLI Publications. pp. 197-216 (2014)

Add citations

You must login to add citations.
  1. Copy and remove as dynamic operators.Carlos Areces, Hans van Ditmarsch, Raul Fervari, Bastien Maubert & François Schwarzentruber - 2021 - Journal of Applied Non-Classical Logics 31 (3-4):181-220.
    In this article, we present a modal logic that extends the basic modal logic ML with two dynamic operators: copy, which replicates the current model, labelling each copy with a different prop...
    Download  
     
    Export citation  
     
    Bookmark  
  • Dynamic epistemic logics: promises, problems, shortcomings, and perspectives.Andreas Herzig - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):328-341.
    Dynamic epistemic logics provide an account of the evolution of agents’ belief and knowledge when they learn the occurrence of an event. These logics started to become popular about 20 years ago and by now there exists a huge number of publications about them. The present paper briefly summarises the existing body of literature, discusses some problems and shortcomings, and proposes some avenues for future research.
    Download  
     
    Export citation  
     
    Bookmark  
  • Announcements to Attentive Agents.Thomas Bolander, Hans van Ditmarsch, Andreas Herzig, Emiliano Lorini, Pere Pardo & François Schwarzentruber - 2016 - Journal of Logic, Language and Information 25 (1):1-35.
    In public announcement logic it is assumed that all agents pay attention to the announcement. Weaker observational conditions can be modelled in action model logic. In this work, we propose a version of public announcement logic wherein it is encoded in the states of the epistemic model which agents pay attention to the announcement. This logic is called attention-based announcement logic. We give an axiomatization of the logic and prove that complexity of satisfiability is the same as that of public (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations