{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:39:28Z","timestamp":1743154768555,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030887001"},{"type":"electronic","value":"9783030887018"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88701-8_25","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:06:25Z","timestamp":1634857585000},"page":"413-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Pinz\u00f3n","sequence":"first","affiliation":[]},{"given":"Santiago","family":"Quintero","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Ram\u00edrez","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Valencia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2017.07.002","volume":"252","author":"T \u00c5gotnes","year":"2017","unstructured":"\u00c5gotnes, T., W\u00e1ng, Y.N.: Resolving distributed knowledge. Artif. Intell. 252, 1\u201321 (2017)","journal-title":"Artif. Intell."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1214\/aos\/1176343654","volume":"4","author":"RJ Aumann","year":"1976","unstructured":"Aumann, R.J.: Agreeing to disagree. Ann. Stat. 4, 1236\u20131239 (1976)","journal-title":"Ann. Stat."},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Bloch, I., Heijmans, H., Ronse, C.: Mathematical morphology. In: Handbook of Spatial Logics. pp. 857\u2013944. Springer Netherlands (2007). https:\/\/doi.org\/10.1007\/978-1-4020-5587-4_14","DOI":"10.1007\/978-1-4020-5587-4_14"},{"key":"25_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic, vol. 35. Oxford University Press, New York (1997)"},{"key":"25_CR5","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, Cambridge (2002)","edition":"2"},{"issue":"3","key":"25_CR6","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 substructural logics. J. Symbolic Logic 70(3), 713\u2013740 (2005)","journal-title":"J. Symbolic Logic"},{"key":"25_CR7","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.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge, 4th edn. MIT press, Cambridge (1995)","edition":"4"},{"issue":"5","key":"25_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/364099.364331","volume":"7","author":"BA Galler","year":"1964","unstructured":"Galler, B.A., Fisher, M.J.: An improved equivalence algorithm. Commun. ACM 7(5), 301\u2013303 (1964)","journal-title":"Commun. ACM"},{"issue":"1","key":"25_CR9","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":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gehrke, M., J\u00f3nsson, B.: Bounded distributive lattice expansions. Mathematica Scandinavica 94(1), 13\u201345 (2004). http:\/\/www.jstor.org\/stable\/24493402","DOI":"10.7146\/math.scand.a-14428"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(89)90032-8","volume":"44","author":"R Goldblatt","year":"1989","unstructured":"Goldblatt, R.: Varieties of complex algebras. Ann. Pure Appl. Logic 44(3), 173\u2013242 (1989). https:\/\/doi.org\/10.1016\/0168-0072(89)90032-8","journal-title":"Ann. Pure Appl. Logic"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"722","DOI":"10.2307\/2033075","volume":"9","author":"G Gr\u00e4tzer","year":"1958","unstructured":"Gr\u00e4tzer, G., Schmidt, E.: On the lattice of all join-endomorphisms of a lattice. Proc. Am. Math. Soc. 9, 722\u2013722 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(95)00232-4","volume":"165","author":"M Habib","year":"1996","unstructured":"Habib, M., Nourine, L.: Tree structure for distributive lattices and its applications. Theor. Comput. Sci. 165(2), 391\u2013405 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-88833-8_6","volume-title":"Computational Logic in Multi-agent Systems","author":"R Hakli","year":"2008","unstructured":"Hakli, R., Negri, S.: Proof theory for distributed knowledge. In: Sadri, F., Satoh, K. (eds.) CLIMA 2007. LNCS (LNAI), vol. 5056, pp. 100\u2013116. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88833-8_6"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549\u2013587 (1990)","journal-title":"J. ACM"},{"issue":"3","key":"25_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00012-015-0348-x","volume":"74","author":"P Jipsen","year":"2015","unstructured":"Jipsen, P., Lawless, N.: Generating all finite modular lattices of a given size. Algebra Universalis 74(3), 253\u2013264 (2015)","journal-title":"Algebra Universalis"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"J\u00f3nnson, B., Tarski, A.: Boolean algebras with operators, Part II. Am. J. Math. 74(1), 127\u2013162 (1952). http:\/\/www.jstor.org\/stable\/2372074","DOI":"10.2307\/2372074"},{"issue":"4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01057646","volume":"53","author":"B J\u00f3nsson","year":"1994","unstructured":"J\u00f3nsson, B.: On the canonicity of Sahlqvist identities. Studia Logica 53(4), 473\u2013491 (1994)","journal-title":"Studia Logica"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"J\u00f3nsson, B., Tarski, A.: Boolean algebras with operators. Part I. Am. J. Mathematics 73(4), 891\u2013939 (1951), http:\/\/www.jstor.org\/stable\/2372123","DOI":"10.2307\/2372123"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2964568","volume":"24","author":"SA Kripke","year":"1959","unstructured":"Kripke, S.A.: A completeness theorem in modal logic. J. Symbolic Logic 24(1), 1\u201314 (1959)","journal-title":"J. Symbolic Logic"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"McKinsey, J.C.C., Tarski, A.: On closed elements in closure algebras. Ann. Math. 47(1), 122\u2013162 (1946). http:\/\/www.jstor.org\/stable\/1969038","DOI":"10.2307\/1969038"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-43520-2_16","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Quintero","year":"2020","unstructured":"Quintero, S., Ramirez, S., Rueda, C., Valencia, F.: Counting and computing join-endomorphisms in lattices. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds.) RAMiCS 2020. LNCS, vol. 12062, pp. 253\u2013269. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43520-2_16"},{"issue":"1","key":"25_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.geb.2008.09.032","volume":"69","author":"D Samet","year":"2010","unstructured":"Samet, D.: Agreeing to disagree: the non-probabilistic case. Games Econ. Behav. 69(1), 169\u2013174 (2010). https:\/\/doi.org\/10.1016\/j.geb.2008.09.032","journal-title":"Games Econ. Behav."},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11229-009-9469-0","volume":"172","author":"D Samet","year":"2010","unstructured":"Samet, D.: S5 knowledge without partitions. Synthese 172(1), 145\u2013155 (2010)","journal-title":"Synthese"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88701-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:11:42Z","timestamp":1725973902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88701-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030887001","9783030887018"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88701-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marseille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics19.lis-lab.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}