{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:11:21Z","timestamp":1759032681841,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_9","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"140-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Modelling Informational Entropy"],"prefix":"10.1007","author":[{"given":"Willem","family":"Conradie","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Craig","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Palmigiano","sequence":"additional","affiliation":[]},{"given":"Nachoem M.","family":"Wijnberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Chodorow, M.S., Ravin, Y., Sachar, H.E.: A tool for investigating the synonymy relation in a sense disambiguated thesaurus. In: Second Conference on Applied Natural Language Processing, pp. 144\u2013151 (1988)","DOI":"10.3115\/974235.974261"},{"key":"9_CR2","unstructured":"Conradie, W., Craig, A.: Relational semantics via TiRS graphs. In: TACL 2015 Extended Abstract (2015)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Conradie, W., Craig, A., Palmigiano, A., Wijnberg, N.: Modelling competing theories. In: Proceedings of the EUSFLAT 2019, Atlantis Studies in Uncertainty Modelling (2019, accepted)","DOI":"10.2991\/eusflat-19.2019.100"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-662-55386-2_7","volume-title":"Logic, Language, Information, and Computation","author":"W Conradie","year":"2017","unstructured":"Conradie, W., Craig, A., Palmigiano, A., Zhao, Z.: Constructive canonicity for lattice-based fixed point logics. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 92\u2013109. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55386-2_7 . ArXiv preprint arXiv:1603.06547"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Conradie, W., et al.: Rough concepts (2019, submitted)","DOI":"10.1016\/j.ins.2020.05.074"},{"key":"9_CR6","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":"9_CR7","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. In: Proceedings of the TARK 2017. EPTCS, vol. 251, pp. 167\u2013186 (2017)","DOI":"10.4204\/EPTCS.251.12"},{"key":"9_CR8","unstructured":"Conradie, W., Palmigiano, A.: Constructive canonicity of inductive inequalities. arXiv preprint arXiv:1603.08341 (2016)"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2019.04.003","author":"W Conradie","year":"2019","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for non-distributive logics. Ann. Pure Appl. Log. (2019). https:\/\/doi.org\/10.1016\/j.apal.2019.04.003","journal-title":"Ann. Pure Appl. Log."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Conradie, W., Palmigiano, A., Robinson, C., Tzimoulis, A., Wijnberg, N.M.: Modelling socio-political competition (2019, submitted)","DOI":"10.1016\/j.fss.2020.02.005"},{"issue":"1\u20132","key":"9_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00012-015-0335-2","volume":"74","author":"A Craig","year":"2015","unstructured":"Craig, A., Gouveia, M., Haviar, M.: TiRS graphs and TiRS frames: a new setting for duals of canonical extensions. Algebra Universalis 74(1\u20132), 123\u2013138 (2015)","journal-title":"Algebra Universalis"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2478\/s12175-014-0278-7","volume":"64","author":"A Craig","year":"2014","unstructured":"Craig, A., Haviar, M.: Reconciliation of approaches to the construction of canonical extensions of bounded lattices. Mathematica Slovaca 64, 1\u201322 (2014)","journal-title":"Mathematica Slovaca"},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10485-012-9287-2","volume":"21","author":"A Craig","year":"2013","unstructured":"Craig, A., Haviar, M., Priestley, H.A.: A fresh perspective on canonical extensions for bounded lattices. Appl. Categor. Struct. 21(6), 725\u2013749 (2013)","journal-title":"Appl. Categor. Struct."},{"key":"9_CR14","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. Cambridge University Press, Cambridge (2002)"},{"key":"9_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Frittella, S., Manoorkar, K., Palmigiano, A., Tzimoulis, A., Wijnberg, N.M.: Towards a Dempster-Shafer theory of concepts (2019, submitted)","DOI":"10.1016\/j.ijar.2020.05.004"},{"key":"9_CR17","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)"},{"issue":"1","key":"9_CR18","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(1), 345\u2013371 (2001)","journal-title":"J. Algebra"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-662-58771-3_14","volume-title":"Logic and Its Applications","author":"G Greco","year":"2019","unstructured":"Greco, G., Jipsen, P., Manoorkar, K., Palmigiano, A., Tzimoulis, A.: Logics for rough concept analysis. In: Khan, M.A., Manuel, A. (eds.) ICLA 2019. LNCS, vol. 11600, pp. 144\u2013159. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58771-3_14"},{"key":"9_CR20","unstructured":"Kr\u00fady, \u00c1., Ladunga, K.: Measuring wavelength discrimination threshold along the entire visible spectrum. Periodica Polytechnica Mechanical Engineering 45(1), 41\u201348"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0010-0285(91)90004-8","volume":"23","author":"RM Nosofsky","year":"1991","unstructured":"Nosofsky, R.M.: Stimulus bias, asymmetric similarity, and classification. Cogn. Psychol. 23(1), 94\u2013140 (1991)","journal-title":"Cogn. Psychol."},{"issue":"7","key":"9_CR22","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/019697298125470","volume":"29","author":"Z Pawlak","year":"1998","unstructured":"Pawlak, Z.: Rough set theory and its applications to data analysis. Cybern. Syst. 29(7), 661\u2013688 (1998)","journal-title":"Cybern. Syst."},{"key":"9_CR23","first-page":"75","volume":"5","author":"M Plo\u0161\u010dica","year":"1995","unstructured":"Plo\u0161\u010dica, M.: A natural representation of bounded lattices. Tatra Mt. Math. Publ. 5, 75\u201388 (1995)","journal-title":"Tatra Mt. Math. Publ."},{"key":"9_CR24","volume-title":"The Mathematical Theory of Communication","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Champaign (1949)"},{"issue":"4","key":"9_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A Tversky","year":"1977","unstructured":"Tversky, A.: Features of similarity. Psychol. Rev. 84(4), 327 (1977)","journal-title":"Psychol. Rev."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T03:51:43Z","timestamp":1721447503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","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":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"41","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":"6","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":"68% - 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":"2,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":"8","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)"}}]}}