{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:24:18Z","timestamp":1742941458398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031427527"},{"type":"electronic","value":"9783031427534"}],"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-42753-4_7","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"98-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isabelle Formalisation of\u00a0Original Representation Theorems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4529-5442","authenticated-orcid":false,"given":"Marco B.","family":"Caminati","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A., Sacerdoti Coen, C.: Some considerations on the usability of interactive provers. In: Intelligent Computer Mathematics: 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, 5\u201310 July 2010, Proceedings, p. 147 (2010)","DOI":"10.1007\/978-3-642-14128-7_13"},{"issue":"11","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. 45(11), 1607\u20131620 (1959)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10817-013-9278-5","volume":"51","author":"JC Blanchette","year":"2013","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending sledgehammer with SMT solvers. J. Autom. Reason. 51(1), 109\u2013128 (2013)","journal-title":"J. Autom. Reason."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-62075-6_17","volume-title":"Intelligent Computer Mathematics","author":"J Bowles","year":"2017","unstructured":"Bowles, J., Caminati, M.B.: A verified algorithm enumerating event structures. In: Geuvers, H., England, M., Hasan, O., Rabe, F., Teschke, O. (eds.) CICM 2017. LNCS (LNAI), vol. 10383, pp. 239\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62075-6_17"},{"key":"7_CR5","series-title":"Computational Biology","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-17297-8_9","volume-title":"Automated Reasoning for Systems Biology and Medicine","author":"JKF Bowles","year":"2019","unstructured":"Bowles, J.K.F., Caminati, M.B.: Balancing prescriptions with constraint solvers. In: Li\u00f2, P., Zuliani, P. (eds.) Automated Reasoning for Systems Biology and Medicine. CB, vol. 30, pp. 243\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17297-8_9"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bowles, J.K., Caminati, M.B., Cha, S.: An integrated framework for verifying multiple care pathways. In: Eleventh International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE Computer Society, United States (2017)","DOI":"10.1109\/TASE.2017.8285628"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Caminati, M.B., Bowles, J.K.F.: Representation theorems obtained by mining across web sources for hints. In: 6th International Conference on Information and Computer Technologies (ICICT). IEEE (2023, in press). https:\/\/eprints.lancs.ac.uk\/id\/eprint\/185196\/","DOI":"10.1109\/ICICT58900.2023.00041"},{"key":"7_CR8","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08434-3","volume-title":"CICM 2014","year":"2014","unstructured":"Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.): CICM 2014. LNCS, vol. 8543. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/sapm1996963339","volume":"96","author":"LJ Cowen","year":"1996","unstructured":"Cowen, L.J., Kleitman, D.J., Lasaga, F., Sussman, D.: Enumeration of full graphs: onset of the asymptotic region. Stud. Appl. Math. 96(3), 339\u2013350 (1996)","journal-title":"Stud. Appl. Math."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/CBO9780511809088"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Enderton, H.B.: Elements of Set Theory. Academic Press, Cambridge (1977)","DOI":"10.1016\/S0049-237X(08)71114-5"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/9780203490204","volume-title":"Handbook of Graph Theory","author":"JL Gross","year":"2003","unstructured":"Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2003)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/jgt.3190200106","volume":"20","author":"DJ Kleitman","year":"1995","unstructured":"Kleitman, D.J., Lasaga, F.R., Cowen, L.J.: Asymptotic enumeration of full graphs. J. Graph Theory 20(1), 59\u201369 (1995)","journal-title":"J. Graph Theory"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Koutsoukou-Argyraki, A., Bak\u0161ys, M., Edmonds, C.: A formalisation of the Balog-Szemer\u00e9di-Gowers theorem in Isabelle\/HOL. In: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 225\u2013238 (2023)","DOI":"10.1145\/3573105.3575680"},{"issue":"10","key":"7_CR16","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1093\/comjnl\/40.10.640","volume":"40","author":"O M\u00fcller","year":"1997","unstructured":"M\u00fcller, O., Slind, K.: Treating partiality in a logic of total functions. Comput. J. 40(10), 640\u2013651 (1997)","journal-title":"Comput. J."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.jal.2005.10.003","volume":"4","author":"A Naumowicz","year":"2006","unstructured":"Naumowicz, A.: An example of formalizing recent mathematical results in Mizar. J. Appl. Log. 4(4), 396\u2013413 (2006)","journal-title":"J. Appl. Log."},{"key":"7_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer, London (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"7_CR19","unstructured":"Nordhoff, B., Lammich, P.: Dijkstra\u2019s shortest path algorithm. Archive of Formal Proofs (2012)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-32347-8_27","volume-title":"Interactive Theorem Proving","author":"L Noschinski","year":"2012","unstructured":"Noschinski, L.: Proof pearl: a probabilistic proof for the girth-chromatic number theorem. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 393\u2013404. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32347-8_27"},{"issue":"1","key":"7_CR21","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."},{"key":"7_CR22","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. In: Annales Mathematicae et Informaticae, vol. 41, pp. 219\u2013234 (2013)"}],"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-031-42753-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T10:47:20Z","timestamp":1703069240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_7","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":"28 August 2023","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":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/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":"31","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":"16","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":"52% - 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)"}}]}}