{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:07:53Z","timestamp":1748336873045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031266881"},{"type":"electronic","value":"9783031266898"}],"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-26689-8_3","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:04:31Z","timestamp":1677024271000},"page":"23-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Labelled Calculi for\u00a0Lattice-Based Modal Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2220-1383","authenticated-orcid":false,"given":"Ineke","family":"van der Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8973-7011","authenticated-orcid":false,"given":"Andrea","family":"De Domenico","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4845-3821","authenticated-orcid":false,"given":"Giuseppe","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3664-7757","authenticated-orcid":false,"given":"Krishna B.","family":"Manoorkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-7527","authenticated-orcid":false,"given":"Alessandra","family":"Palmigiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9218-5449","authenticated-orcid":false,"given":"Mattia","family":"Panettiere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3529255","volume":"23","author":"J Chen","year":"2022","unstructured":"Chen, J., Greco, G., Palmigiano, A., Tzimoulis, A.: Syntactic completeness of proper display calculi. ACM Trans. Comput. Log. 23, 1\u201346 (2022)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ins.2020.05.074","volume":"561","author":"W Conradie","year":"2021","unstructured":"Conradie, W., Frittella, S., Manoorkar, K., Nazari, S., Palmigiano, A., Tzimoulus, A., Wijnberg, N.M.: Rough concepts. Inf. Sci. 561, 371\u2013413 (2021)","journal-title":"Inf. Sci."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-52921-8_10","volume-title":"Logic, Language, Information, and Computation","author":"W Conradie","year":"2016","unstructured":"Conradie, W., Frittella, S., Palmigiano, A., Piazzai, M., Tzimoulis, A., Wijnberg, N.M.: Categories: how i learned to stop worrying and love two sorts. In: V\u00e4\u00e4n\u00e4nen, J., Hirvonen, \u00c5., de Queiroz, R. (eds.) WoLLIC 2016. LNCS, vol. 9803, pp. 145\u2013164. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52921-8_10"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Conradie, W., Frittella, S., Palmigiano, A., Piazzai, M., Tzimoulis, A., Wijnberg, N.M.: Toward an epistemic-logical theory of categorization. EPTCS, vol. 251 (2017)","DOI":"10.4204\/EPTCS.251.12"},{"key":"3_CR5","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1007\/978-3-319-06025-5_36","volume-title":"Johan van Benthem on Logic and Information Dynamics","author":"W Conradie","year":"2014","unstructured":"Conradie, W., Ghilardi, S., Palmigiano, A.: Unified correspondence. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics. OCL, vol. 5, pp. 933\u2013975. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06025-5_36"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.apal.2011.10.004","volume":"163","author":"W Conradie","year":"2012","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for distributive modal logic. Ann. Pure Appl. Logic 163(3), 338\u2013376 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"9","key":"3_CR7","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.apal.2019.04.003","volume":"170","author":"W Conradie","year":"2019","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for non-distributive logics. Ann. Pure Appl. Logic 170(9), 923\u2013974 (2019)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR8","unstructured":"Conradie, W., Palmigiano, A., Robinson, C., Wijnberg, N.: Non-distributive logics: from semantics to meaning. In: Rezus, A. (ed.) Contemporary Logic and Computing. Landscapes in Logic, vol. 1, pp. 38\u201386. College Publications (2020)"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, New York (2002)","edition":"2"},{"key":"3_CR10","unstructured":"De Domenico, A., Greco, G.: Algorithmic correspondence and analytic rules. In: Advances in Modal Logic, vol. 14, pp. 371\u2013389. College Publications (2022)"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2178\/jsl\/1122038911","volume":"70","author":"JM Dunn","year":"2005","unstructured":"Dunn, J.M., Gehrke, M., Palmigiano, A.: Canonical extensions and relational completeness of some structural logics. J. Symb. Log. 70(3), 713\u2013740 (2005)","journal-title":"J. Symb. Log."},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1093\/logcom\/exu068","volume":"26","author":"S Frittella","year":"2016","unstructured":"Frittella, S., Greco, G., Kurz, A., Palmigiano, A., Sikimi\u0107, V.: Multi-type display calculus for dynamic epistemic logic. J. Log. Comput. 26(6), 2017\u20132065 (2016)","journal-title":"J. Log. Comput."},{"key":"3_CR13","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"2012","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (2012)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1006\/jabr.2000.8622","volume":"238","author":"M Gehrke","year":"2001","unstructured":"Gehrke, M., Harding, J.: Bounded lattice expansions. J. Algebra 238, 345\u2013371 (2001)","journal-title":"J. Algebra"},{"issue":"7","key":"3_CR15","first-page":"1367","volume":"28","author":"G Greco","year":"2016","unstructured":"Greco, G., Ma, M., Palmigiano, A., Tzimoulis, A., Zhao, Z.: Unified correspondence as a proof-theoretic tool. J. Log. Comput. 28(7), 1367\u20131442 (2016)","journal-title":"J. Log. Comput."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logic. J. Philos. Log. 34, 507\u2013544 (2005)","journal-title":"J. Philos. Log."},{"issue":"1","key":"3_CR17","first-page":"71","volume":"51","author":"S Negri","year":"2012","unstructured":"Negri, S., Dyckhoff, R.: Proof analysis in intermediate logics. Arch. Math. Logic 51(1), 71\u201392 (2012)","journal-title":"Arch. Math. Logic"},{"issue":"5","key":"3_CR18","first-page":"341","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. IJCIS 11(5), 341\u2013356 (1982)","journal-title":"IJCIS"},{"key":"3_CR19","unstructured":"Simpson, A.K.: The proof theory and semantics of intuitionistic modal logic. Ph.D. dissertation, University of Edinburgh (1994)"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"van der Berg, I., De Domenico, A., Greco, G., Manoorkar, K., Palmigiano, A., Panettiere, M.: Labelled calculi for the logics of rough concepts. In: Banerjee, M., Sreejith, A.V. (eds.) ICLA 2023. LNCS, vol. 13963, pp. 172\u2013188. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-26689-8_13","DOI":"10.1007\/978-3-031-26689-8_13"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Wansing, H.: Displaying Modal Logic. Kluwer (1998)","DOI":"10.1007\/978-94-017-1280-4"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-94-010-0387-2_2","volume-title":"Handbook of Philosophical Logic","author":"H Wansing","year":"2002","unstructured":"Wansing, H.: Sequent systems for modal logics. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 8, pp. 61\u2013145. Springer, Dordrecht (2002). https:\/\/doi.org\/10.1007\/978-94-010-0387-2_2"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26689-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:05:12Z","timestamp":1677024312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26689-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031266881","9783031266898"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26689-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indian Conference on Logic and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"3 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icla2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icla2023.iiti.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"9","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":"50% - 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":"3","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)"}},{"value":"This proceeding includes 6 Invited paper","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}