{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:45:18Z","timestamp":1783111518811,"version":"3.54.6"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031397837","type":"print"},{"value":"9783031397844","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39784-4_22","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T22:02:07Z","timestamp":1693260127000},"page":"351-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decidability of\u00a0Modal Logics of\u00a0Non-k-Colorable Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7434-5894","authenticated-orcid":false,"given":"Ilya","family":"Shapirovsky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"22_CR1","volume-title":"Modal Logic, Volume 53 of Cambridge Tracts in Theoretical Computer Science","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic, Volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001)"},{"key":"22_CR2","volume-title":"Modal Logic, Volume 35 of Oxford Logic Guides","author":"A Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic, Volume 35 of Oxford Logic Guides. Oxford University Press, Oxford (1997)"},{"key":"22_CR3","unstructured":"De Grey, A.D.N.J.: The chromatic number of the plane is at least 5. arXiv preprint arXiv:1804.02385 (2018)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Ding, Y., Liu, J., Wang, Y.: Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic. Synthese 201(2), 46 (2023)","DOI":"10.1007\/s11229-022-04032-y"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"566","DOI":"10.2307\/2275293","volume":"57","author":"M de Rijke","year":"1992","unstructured":"de Rijke, M.: The modal logic of inequality. J. Symb. Log. 57(2), 566\u2013584 (1992)","journal-title":"J. Symb. Log."},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s00454-019-00058-1","volume":"64","author":"G Exoo","year":"2020","unstructured":"Exoo, G., Ismailescu, D.: The chromatic number of the plane is at least 5: a new proof. Discrete Comput. Geom. 64(1), 216\u2013226 (2020). https:\/\/doi.org\/10.1007\/s00454-019-00058-1","journal-title":"Discrete Comput. Geom."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Fine, K.: Some connections between elementary and modal logic. In: Kanger, S. (ed.) Proceedings of the Third Scandinavian Logic Symposium, Volume 82 of Studies in Logic and the Foundations of Mathematics, pp. 15\u201331. Elsevier (1975)","DOI":"10.1016\/S0049-237X(08)70723-7"},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G Gargov","year":"1993","unstructured":"Gargov, G., Goranko, V.: Modal logic with names. J. Philos. Log. 22(6), 607\u2013636 (1993). https:\/\/doi.org\/10.1007\/BF01054038","journal-title":"J. Philos. Log."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11225-017-9732-1","volume":"106","author":"R Goldblatt","year":"2018","unstructured":"Goldblatt, R., Hodkinson, I.: The finite model property for logics with the tangle modality. Stud. Logica 106(1), 131\u2013166 (2018). https:\/\/doi.org\/10.1007\/s11225-017-9732-1","journal-title":"Stud. Logica"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.2178\/bsl\/1082986262","volume":"10","author":"R Goldblatt","year":"2004","unstructured":"Goldblatt, R., Hodkinson, I., Venema, Y.: Erd\u00f6s graphs resolve Fine\u2019s canonicity problem. Bull. Symb. Log. 10(2), 186\u2013208 (2004)","journal-title":"Bull. Symb. Log."},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00935597","volume":"49","author":"GE Hughes","year":"1990","unstructured":"Hughes, G.E.: Every world can see a reflexive world. Stud. Logica Int. J. Symb. Log. 49(2), 175\u2013181 (1990). https:\/\/doi.org\/10.1007\/BF00935597","journal-title":"Stud. Logica Int. J. Symb. Log."},{"key":"22_CR12","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-94-017-8860-1_11","volume-title":"Leo Esakia on Duality in Modal and Intuitionistic Logics","author":"A Kudinov","year":"2014","unstructured":"Kudinov, A., Shehtman, V.: Derivational modal logics with the difference modality. In: Bezhanishvili, G. (ed.) Leo Esakia on Duality in Modal and Intuitionistic Logics. OCL, vol. 4, pp. 291\u2013334. Springer, Dordrecht (2014). https:\/\/doi.org\/10.1007\/978-94-017-8860-1_11"},{"key":"22_CR13","unstructured":"Kikot, S., Shapirovsky, I., Zolin, E.: Filtration safe operations on frames. In: Gor\u00e9, R., Kooi, B.P., Kurucz, A. (eds.) Advances in Modal Logic, no. 10, pp. 333\u2013352. College Publications (2014)"},{"key":"22_CR14","unstructured":"Kikot, S., Shapirovsky, I., Zolin, E.: Modal logics with transitive closure: completeness, decidability, filtration. In: Olivetti, N., Verbrugge, R., Negri, S., Sandu, G. (eds.) 13th Conference on Advances in Modal Logic, AiML 2020, Helsinki, Finland, 24\u201328 August 2020, pp. 369\u2013388. College Publications (2020)"},{"key":"22_CR15","unstructured":"Shehtman, V.: Derived sets in Euclidean spaces and modal logic. Technical report, ITLI Prepublication Series, University of Amsterdam, X-1990-05 (1990)"}],"updated-by":[{"DOI":"10.1007\/978-3-031-39784-4_25","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000}}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39784-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T13:07:02Z","timestamp":1701176822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39784-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031397837","9783031397844"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39784-4_22","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-031-39784-4_25","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"29 November 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}