{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:51:21Z","timestamp":1759146681668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030810962"},{"type":"electronic","value":"9783030810979"}],"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-81097-9_1","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:04:38Z","timestamp":1626735878000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Modular First Formalisation of Combinatorial Design Theory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8559-9133","authenticated-orcid":false,"given":"Chelsea","family":"Edmonds","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0288-4279","authenticated-orcid":false,"given":"Lawrence C.","family":"Paulson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-24849-1_3","volume-title":"Types for Proofs and Programs","author":"C Ballarin","year":"2004","unstructured":"Ballarin, C.: Locales and locale expressions in Isabelle\/Isar. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 34\u201350. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24849-1_3"},{"key":"1_CR2","unstructured":"Ballarin, C.: Tutorial to locales and locale interpretation. In: Contribuciones Cient\u00edficas en Honor de Mirian Andr\u00e9s G\u00f3mez, pp. 123\u2013140. University of Rioja (2010). https:\/\/dialnet.unirioja.es\/servlet\/articulo?codigo=3216664"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1007\/s10817-019-09537-9","volume":"64","author":"C Ballarin","year":"2020","unstructured":"Ballarin, C.: Exploring the structure of an algebra text with locales. J. Autom. Reason. 64(6), 1093\u20131121 (2020)","journal-title":"J. Autom. Reason."},{"key":"1_CR4","unstructured":"Bentkamp, A.: Latin square. Isabelle Archive of Formal Proofs (Dec 2015). http:\/\/isa-afp.org\/entries\/Latin_Square.html"},{"key":"1_CR5","volume-title":"Design Theory, Encyclopedia of Mathematics and Its Applications","author":"T Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, Encyclopedia of Mathematics and Its Applications, vol. 1, 2nd edn. Cambridge University Press, Cambridge (1999)","edition":"2"},{"key":"1_CR6","unstructured":"Cameron, P.J., van Lint, J.H.: Designs, Graphs, Codes and Their Links, London Mathematical Society Student Texts. vol. 22. Cambridge University Press, Cambridge (1996)"},{"key":"1_CR7","unstructured":"Carette, J., Farmer, W.M., Jeremic, F., Maccio, V., O\u2019Connor, R., Tran, Q.M.: The MathScheme Library: Some Preliminary Experiments. arXiv:1106.1862 (Jun 2011)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2007)","DOI":"10.1201\/9781420010541"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-55602-8_192","volume-title":"Automated Deduction\u2014CADE-11","author":"WM Farmer","year":"1992","unstructured":"Farmer, W.M., Guttman, J.D., Javier Thayer, F.: Little theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 567\u2013581. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_192"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-74464-1_11","volume-title":"Types for Proofs and Programs","author":"F Haftmann","year":"2007","unstructured":"Haftmann, F., Wenzel, M.: Constructive type classes in Isabelle. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 160\u2013174. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74464-1_11"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-02444-3_10","volume-title":"Types for Proofs and Programs","author":"F Haftmann","year":"2009","unstructured":"Haftmann, F., Wenzel, M.: Local theory specifications in Isabelle\/Isar. In: Berardi, S., Damiani, F., de\u2019Liguoro, U. (eds.) TYPES 2008. LNCS, vol. 5497, pp. 153\u2013168. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02444-3_10"},{"key":"1_CR12","unstructured":"Keinholz, J.: Matroids. Isabelle Archive of Formal Proofs (Nov 2018). https:\/\/www.isa-afp.org\/entries\/Matroids.html"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11786-014-0183-z","volume":"9","author":"L Noschinski","year":"2015","unstructured":"Noschinski, L.: A graph library for Isabelle. Math. Comput. Sci. 9(1), 23\u201339 (2015)","journal-title":"Math. Comput. Sci."},{"issue":"2210","key":"1_CR14","doi-asserted-by":"publisher","first-page":"20170872","DOI":"10.1098\/rspa.2017.0872","volume":"474","author":"LC Paulson","year":"2018","unstructured":"Paulson, L.C.: Computational logic: its origins and applications. Proc. R. Soc. A 474(2210), 20170872 (2018)","journal-title":"Proc. R. Soc. A"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Soicher, L.H.: Designs, groups and computing. In: Detinko, A., Flannery, D., O\u2019Brien, E. (eds.) Probabilistic Group Theory, Combinatorics, and Computing. Lecture Notes in Mathematics, vol. 2070, pp. 83\u2013107. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-4814-2_3","DOI":"10.1007\/978-1-4471-4814-2_3"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Stinson, D.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2004). https:\/\/doi.org\/10.1007\/b97564","DOI":"10.1007\/b97564"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81097-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:05:41Z","timestamp":1626735941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81097-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030810962","9783030810979"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81097-9_1","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":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Timisoara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","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":"26 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2021\/cicm.php","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":"38","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":"12","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":"8","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":"32% - 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,5","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)"}}]}}