{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:17:15Z","timestamp":1747153035032,"version":"3.40.5"},"publisher-location":"Cham","reference-count":17,"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_12","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:06:25Z","timestamp":1634857585000},"page":"192-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isolated Sublattices and Their Application to Counting Closure Operators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7909-1942","authenticated-orcid":false,"given":"Roland","family":"Gl\u00fcck","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-43520-2_1","volume-title":"Relational and Algebraic Methods in Computer Science","author":"N Alpay","year":"2020","unstructured":"Alpay, N., Jipsen, P.: Commutative doubly-idempotent semirings determined by chains and by preorder forests. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds.) RAMiCS 2020. LNCS, vol. 12062, pp. 1\u201314. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43520-2_1"},{"key":"12_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Berghammer, R., B\u00f6rm, S., Winter, M.: Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension. Appl. Math. Comput. 389, 125523 (2021)","DOI":"10.1016\/j.amc.2020.125523"},{"key":"12_CR4","volume-title":"Lattice Theory","author":"G Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, New York (1967)","edition":"3"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-02149-8_11","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Bonzio","year":"2018","unstructured":"Bonzio, S., Baldi, M.P., Valota, D.: Counting finite linearly ordered involutive bisemilattices. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 166\u2013183. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02149-8_11"},{"key":"12_CR6","unstructured":"Brinkmann, G., Deklerck, R.: Generation of union-closed sets and Moore families. J. Integer Seq. 21(1), 18.1.7 (2018)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(02)00209-3","volume":"127","author":"N Caspard","year":"2003","unstructured":"Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Appl. Math. 127(2), 241\u2013269 (2003)","journal-title":"Discrete Appl. Math."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11928-6_6","volume-title":"Formal Concept Analysis","author":"P Colomb","year":"2010","unstructured":"Colomb, P., Irlande, A., Raynaud, O.: Counting of Moore families for n=7. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 72\u201387. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11928-6_6"},{"key":"12_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, Cambridge (2002)","edition":"2"},{"issue":"3","key":"12_CR10","first-page":"129","volume":"10","author":"J Demetrovics","year":"1992","unstructured":"Demetrovics, J., Hencsey, G., Libkin, L., Muchnik, I.B.: On the interaction between closure operations and choice functions with applications to relational database. Acta Cybern. 10(3), 129\u2013139 (1992)","journal-title":"Acta Cybern."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jlap.2014.02.007","volume":"83","author":"S Elloumi","year":"2014","unstructured":"Elloumi, S., Boulifa, B., Jaoua, A., Saleh, M., Al Otaibi, J., Frias, M.F.: Inference engine based on closure and join operators over truth table binary relations. J. Log. Algebraic Methods Program. 83(2), 180\u2013193 (2014)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-57418-9_7","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R Gl\u00fcck","year":"2017","unstructured":"Gl\u00fcck, R.: Algebraic investigation of connected components. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 109\u2013126. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57418-9_7"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-17796-5_5","volume-title":"Algebraic Methodology and Software Technology","author":"R Gl\u00fcck","year":"2011","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: Model refinement using bisimulation quotients. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 76\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17796-5_5"},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: Foundation. Springer, Basel (2011). https:\/\/doi.org\/10.1007\/978-3-0348-0018-1"},{"key":"12_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090224","volume-title":"Varieties of Lattices","author":"P Jipsen","year":"1992","unstructured":"Jipsen, P., Rose, H.: Varieties of Lattices, 1st edn. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0090224","edition":"1"},{"key":"12_CR16","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"},{"key":"12_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78901-9","volume-title":"Lattices and Ordered Sets","author":"S Roman","year":"2008","unstructured":"Roman, S.: Lattices and Ordered Sets, 1st edn. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-78901-9","edition":"1"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T00:47:57Z","timestamp":1634863677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88701-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030887001","9783030887018"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88701-8_12","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"}}]}}