{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:02:10Z","timestamp":1765123330002,"version":"3.40.5"},"reference-count":53,"publisher":"Informa UK Limited","issue":"3-4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Non-Classical Logics"],"published-print":{"date-parts":[[2021,10,2]]},"DOI":"10.1080\/11663081.2021.1964327","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T14:54:04Z","timestamp":1629730444000},"page":"181-220","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Copy and remove as dynamic operators"],"prefix":"10.1080","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7845-8503","authenticated-orcid":false,"given":"Carlos","family":"Areces","sequence":"first","affiliation":[{"name":"CONICET & FAMAF, Universidad Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-8687","authenticated-orcid":false,"given":"Hans","family":"van Ditmarsch","sequence":"additional","affiliation":[{"name":"Open University, Heerlen, The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0725","authenticated-orcid":false,"given":"Raul","family":"Fervari","sequence":"additional","affiliation":[{"name":"CONICET & FAMAF, Universidad Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9081-2920","authenticated-orcid":false,"given":"Bastien","family":"Maubert","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Napoli \u201cFederico II\u201d, Napoli, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1228-4333","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Schwarzentruber","sequence":"additional","affiliation":[{"name":"Univ Rennes, CNRS, IRISA, Rennes, France"}]}],"member":"301","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-010-9838-8"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Areces C., Fervari R. & Hoffmann G. (2012). Moving arrows and four model checking results. In L. Ong and R. Queiroz (Eds.), Logic, language, information and computation, volume 7456 of LNCS (pp. 142\u2013153). Springer.","DOI":"10.1007\/978-3-642-32621-9_11"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzt030"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzv020"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exy022"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73579-5_1"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Areces C. & ten Cate B. (2005). Hybrid logics. In Blackburn et al.\u00a0(2006), (pp. 821\u2013868).","DOI":"10.1016\/S1570-2464(07)80017-6"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Areces C., van Ditmarsch H., Fervari R. & Schwarzentruber F. (2014). Logics with copy and remove. In Proceedings of WoLLIC 2014.\u00a0Springer.","DOI":"10.1007\/978-3-662-44145-9_4"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.01.004"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.02.042"},{"key":"CIT0011","unstructured":"Aucher G. & Schwarzentruber F. (2013, January). On the complexity of dynamic epistemic logic. In Proceedings of TARK 2013.\u00a0Electronic Notes in Theoretical Computer Science (ENTCS)."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exx034"},{"key":"CIT0013","unstructured":"Baltag A., Moss L. & Solecki S. (1998, July). The logic of public announcements, common knowledge and private suspicions. In I. Gilboa (Eds.), TARK 1998 (pp. 43\u201356). Morgan Kaufmann."},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Bednarczyk B., Demri S., Fervari R. & Mansutti A. (2020). Modal logics with composition on finite forests: Expressivity and complexity. In 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS'20) (pp. 167\u2013180). IEEE Press.","DOI":"10.1145\/3373718.3394787"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2019.07.005"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Blackburn P., de Rijke M. & Venema Y. (2001). Modal logic, volume 53 of Cambridge tracts in theoretical computer science. Cambridge University Press.","DOI":"10.1017\/CBO9781107050884"},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"Blackburn P. & van Benthem J. (2006). Modal logic: A semantic perspective. In Handbook of modal logics, volume 3 of Studies in logic and practical reasoning. Elsevier.","DOI":"10.1016\/S1570-2464(07)80004-8"},{"key":"CIT0018","unstructured":"Blackburn P., Wolter F. & van Benthem J. (2006). Handbook of modal logics, volume 3 of Studies in logic and practical reasoning. Elsevier."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2015.1018801"},{"key":"CIT0020","unstructured":"Demri S. & Fervari R. (2018). On the complexity of modal separation logics. In AiML'18 (pp. 179\u2013198). College Publications."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz019"},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"Demri S., Fervari R. & Mansutti A. (2019). Axiomatising logics with separating conjunctions and modalities. In JELIA'19, volume 11468 of LNAI (pp. 692\u2013708). Springer.","DOI":"10.1007\/978-3-030-19570-0_45"},{"key":"CIT0023","unstructured":"Fervari R. (2014). Relation-changing modal logics. PhD diss., Facultad de Matem\u00e1tica Astronom\u00eda y F\u00edsica, Universidad Nacional de C\u00f3rdoba, Argentina."},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Fervari R. & Vel\u00e1zquez-Quesada F. (2017). Dynamic epistemic logics of introspection. In DaL\u00ed 2017, volume 10669 of LNCS (pp. 82\u201397). Springer.","DOI":"10.1007\/978-3-319-73579-5_6"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2019.06.005"},{"key":"CIT0026","unstructured":"French T., Hales J. & Tay E. (2014). A composable language for action models. In AiML'14 (pp. 197\u2013216). College Publications."},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Gierasimczuk N., Kurzen L. & Vel\u00e1zquez-Quesada F. (2009). Learning and teaching as a game: A sabotage approach. In X. He, J. Horty, and E. Pacuit (Eds.), Logic, rationality, and interaction, second international workshop, LORI 2009, volume 5834 of LNCS (pp. 119\u2013132). Springer.","DOI":"10.1007\/978-3-642-04893-7_10"},{"key":"CIT0028","unstructured":"Goldblatt R. (1995). Saturation and the Hennessy-Milner property. In A. Ponse, M. de Rijke, and Y. Venema (Eds.), Modal logic and process algebra, number 53 in CSLI Lecture Notes (pp. 107\u2013129). CSLI Publications."},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1754-0_6"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"CIT0031","doi-asserted-by":"crossref","unstructured":"Horrocks I., Hustadt U., Sattler U. & Schmidt R. (2007). Computational modal logic. In Handbook of modal logics, volume 3 of Studies in logic and practical reasoning. Elsevier (pp. 181\u2013245).","DOI":"10.1016\/S1570-2464(07)80007-3"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020311000189"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1145\/2000378.2000403"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19630090502"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz036"},{"key":"CIT0036","doi-asserted-by":"crossref","unstructured":"L\u00f6ding C. & Rohde P. (2003). Model checking and satisfiability for sabotage modal logic. In P. Pandya and J. Radhakrishnan (Eds.), Proceedings of 23rd Conference Foundations of Software Technology and Theoretical Computer Science, volume 2914 of LNCS (pp. 302\u2013313). Springer.","DOI":"10.1007\/978-3-540-24597-1_26"},{"key":"CIT0037","doi-asserted-by":"crossref","unstructured":"L\u00f6ding C. & Rohde P. (2003). Solving the sabotage game is PSPACE-hard. In Mathematical foundations of computer science 2003, volume 2747 of LNCS (pp. 531\u2013540). Springer.","DOI":"10.1007\/978-3-540-45138-9_47"},{"key":"CIT0038","doi-asserted-by":"crossref","unstructured":"Maubert B., Pinchinat S., Schwarzentruber F. & Stranieri S. (2020). Concurrent games in dynamic epistemic logic. In C. Bessiere (Eds.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (pp. 1877\u20131883).","DOI":"10.24963\/ijcai.2020\/260"},{"key":"CIT0039","unstructured":"Mera S. (2009). Modal memory logics. PhD diss., Universidad de Buenos Aires, and UFR STMIA \u2013 Ecole Doctorale IAEM."},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.04.003"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1145\/1516507.1516510"},{"key":"CIT0042","unstructured":"Schwarzentruber F. (2019). Epistemic reasoning in AI, Habilitation \u00e0 diriger des recherches."},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9151-9"},{"key":"CIT0044","unstructured":"van Benthem J. (1976). Modal correspondence theory. PhD diss., University of Amsterdam."},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32254-2_16"},{"key":"CIT0046","doi-asserted-by":"crossref","unstructured":"van Ditmarsch H. & French T. (2009). Simulation and information. In J. Broersen and J. Meyer (Eds.), Knowledge representation for agents and multi-agent systems, LNAI 5605 (pp. 51\u201365). Springer.","DOI":"10.1007\/978-3-642-05301-6_4"},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2012.705964"},{"key":"CIT0048","unstructured":"van Ditmarsch H. & Kooi B. (2008). Semantic results for ontic and epistemic change. In Proceedings of 7th LOFT, Texts in Logic and Games 3, (pp. 87\u2013117). Amsterdam University Press."},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-1001-6_6"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5839-4"},{"issue":"11","key":"CIT0051","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2020.104544","volume":"275","author":"van Ditmarsch H.","year":"2020","journal-title":"Information and Computation"},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-012-0083-1"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.21.397-425"}],"container-title":["Journal of Applied Non-Classical Logics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/11663081.2021.1964327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T11:07:39Z","timestamp":1642417659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/11663081.2021.1964327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":53,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2021,10,2]]}},"alternative-id":["10.1080\/11663081.2021.1964327"],"URL":"https:\/\/doi.org\/10.1080\/11663081.2021.1964327","relation":{},"ISSN":["1166-3081","1958-5780"],"issn-type":[{"type":"print","value":"1166-3081"},{"type":"electronic","value":"1958-5780"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tncl20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tncl20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-10-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}