{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:20:09Z","timestamp":1743142809557,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031098260"},{"type":"electronic","value":"9783031098277"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-09827-7_4","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T16:46:47Z","timestamp":1655830007000},"page":"48-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Definitional Quantifiers Realise Semantic Reasoning for\u00a0Proof by\u00a0Induction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6693-5325","authenticated-orcid":false,"given":"Yutaka","family":"Nagashima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,22]]},"reference":[{"key":"4_CR1","unstructured":"Blaauwbroek, L., Urban, J., Geuvers, H.: Tactic learning and proving for the Coq proof assistant. In: LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Alicante, Spain (2020)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-22438-6_11","volume-title":"Automated Deduction \u2013 CADE-23","author":"JC Blanchette","year":"2011","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending sledgehammer with SMT solvers. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 116\u2013130. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_11"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1","volume-title":"Automated Reasoning","year":"2010","unstructured":"Giesl, J., H\u00e4hnle, R. (eds.): IJCAR 2010. LNCS (LNAI), vol. 6173. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14203-1"},{"key":"4_CR4","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic Handbook, Perspectives in Computing, vol. 23. Academic Press (1979)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0012826","volume-title":"9th International Conference on Automated Deduction","author":"A Bundy","year":"1988","unstructured":"Bundy, A.: The use of explicit plans to guide inductive proofs. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 111\u2013120. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0012826"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The automation of proof by mathematical induction. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning (in 2 volumes), pp. 845\u2013911. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bundy, A., Stevens, A., van Harmelen, F., Ireland, A., Smaill, A.: Rippling: A heuristic for guiding inductive proofs. Artif. Intell. 62, 185\u2013253 (1993)","DOI":"10.1016\/0004-3702(93)90079-Q"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-66167-4_10","volume-title":"Frontiers of Combining Systems","author":"S Cruanes","year":"2017","unstructured":"Cruanes, S.: Superposition with structural induction. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 172\u2013188. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_10"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Czajka, \u0141, Kaliszyk, C.: Hammer for Coq: automation for dependent type theory. J. Autom. Reasoning, 423\u2013453 (2018). https:\/\/doi.org\/10.1007\/s10817-018-9458-4","DOI":"10.1007\/s10817-018-9458-4"},{"key":"4_CR10","unstructured":"Dixon, L.: A proof planning framework for Isabelle. Ph.D. thesis, University of Edinburgh, UK (2006). http:\/\/hdl.handle.net\/1842\/1250"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-45085-6_22","volume-title":"Automated Deduction \u2013 CADE-19","author":"L Dixon","year":"2003","unstructured":"Dixon, L., Fleuriot, J.: IsaPlanner: a prototype proof planner in Isabelle. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 279\u2013283. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45085-6_22"},{"key":"4_CR12","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J.: TacticToe: learning to reason with HOL4 tactics. In: LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7\u201312 May 2017 (2017)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0031814","volume-title":"Formal Methods in Computer-Aided Design","author":"J Harrison","year":"1996","unstructured":"Harrison, J.: HOL light: a tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265\u2013269. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0031814"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Heras, J., Komendantskaya, E., Johansson, M., Maclean, E.: Proof-pattern recognition and lemma discovery in ACL2. In: Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, 14\u201319 December 2013. Proceedings (2013)","DOI":"10.1007\/978-3-642-45221-5_27"},{"key":"4_CR15","unstructured":"Hozzov\u00e1, P., Kov\u00e1cs, L., Schoisswohl, J., Voronkov, A.: Induction with generalization in superposition reasoning. EasyChair Preprint no. 2468 (EasyChair 2020) (2020)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-99957-9_6","volume-title":"Artificial Intelligence and Symbolic Computation","author":"Y Jiang","year":"2018","unstructured":"Jiang, Y., Papapanagiotou, P., Fleuriot, J.: Machine learning for inductive theorem proving. In: Fleuriot, J., Wang, D., Calmet, J. (eds.) AISC 2018. LNCS (LNAI), vol. 11110, pp. 87\u2013103. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99957-9_6"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08434-3","volume-title":"Intelligent Computer Mathematics","year":"2014","unstructured":"Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.): CICM 2014. LNCS (LNAI), vol. 8543. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Steele Jr., G.L.: An overview of common Lisp. In: Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, 15\u201318 August 1982, Pittsburgh, PA, USA (1982)","DOI":"10.1145\/800068.802140"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kaliszyk, C., Urban, J.: Hol(y)hammer: online ATP service for HOL light. Math. Comput. Sci. 9, 5\u201322 (2015)","DOI":"10.1007\/s11786-014-0182-0"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Moore, J.S.: An industrial strength theorem prover for a logic based on common lisp. IEEE Trans. Software Eng. 23, 203\u2013213 (1997)","DOI":"10.1109\/32.588534"},{"key":"4_CR21","unstructured":"Klein, G., Nipkow, T., Paulson, L., Thiemann, R.: The Archive of Formal Proofs (2004). https:\/\/www.isa-afp.org\/"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39799-8_1","volume-title":"Computer Aided Verification","author":"L Kov\u00e1cs","year":"2013","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1"},{"key":"4_CR23","unstructured":"Lammich, P., Nipkow, T.: Priority search trees. Arch. Formal Proofs (2019)"},{"key":"4_CR24","unstructured":"Lammich, P., Wimmer, S.: Verifythis 2019 - polished Isabelle solutions. Arch. Formal Proofs (2019)"},{"key":"4_CR25","unstructured":"Meis, R., Nielsen, F., Lammich, P.: Binomial heaps and skew binomial heaps. Arch. Formal Proofs (2010)"},{"key":"4_CR26","unstructured":"Moore, J.S.: Computational logic: structure sharing and proof of program properties. Ph.D. thesis, University of Edinburgh, UK (1973)"},{"key":"4_CR27","unstructured":"Moore, J.S.: Symbolic simulation: an ACL2 approach. In: Formal Methods in Computer-Aided Design, Second International Conference, FMCAD 1998, Palo Alto, California, USA, 4\u20136 November 1998, Proceedings (1998)"},{"key":"4_CR28","unstructured":"Moore, J.S., Wirth, C.: Automation of mathematical induction as part of the history of logic. CoRR abs\/1309.6226 (2013). http:\/\/arxiv.org\/abs\/1309.6226"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: The lean theorem prover (system description). In: Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany (2015)","DOI":"10.1007\/978-3-319-21401-6_26"},{"key":"4_CR30","unstructured":"Nagashima, Y.: Data61\/PSL (2017). https:\/\/github.com\/data61\/PSL\/releases\/tag\/v0.2.1-alpha"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-34175-6_14","volume-title":"Programming Languages and Systems","author":"Y Nagashima","year":"2019","unstructured":"Nagashima, Y.: LiFtEr: language to encode induction heuristics for Isabelle\/HOL. In: Lin, A.W. (ed.) APLAS 2019. LNCS, vol. 11893, pp. 266\u2013287. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_14"},{"key":"4_CR32","unstructured":"Nagashima, Y.: Smart induction for Isabelle\/HOL (tool paper). In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design - FMCAD 2020 (2020)"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Nagashima, Y.: Faster smarter proof by induction in Isabelle\/HOL. In: Zhou, Z. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event\/Montreal, Canada, 19\u201327 August 2021, pp. 1981\u20131988. ijcai.org (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/273","DOI":"10.24963\/ijcai.2021\/273"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Nagashima, Y., He, Y.: PaMpeR: proof method recommendation system for Isabelle\/HOL. In: Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France (2018)","DOI":"10.1145\/3238147.3238210"},{"key":"4_CR35","volume-title":"Automated Deduction - CADE 26\u201326th International Conference on Automated Deduction","author":"Y Nagashima","year":"2017","unstructured":"Nagashima, Y., Kumar, R.: A proof strategy language and proof script generation for Isabelle\/HOL. In: de Moura, L. (ed.) Automated Deduction - CADE 26\u201326th International Conference on Automated Deduction. Gothenburg, Sweden (2017)"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-96812-4_19","volume-title":"Intelligent Computer Mathematics","author":"Y Nagashima","year":"2018","unstructured":"Nagashima, Y., Parsert, J.: Goal-oriented conjecturing for\u00a0Isabelle\/HOL. In: Rabe, F., Farmer, W.M., Passmore, G.O., Youssef, A. (eds.) CICM 2018. LNCS (LNAI), vol. 11006, pp. 225\u2013231. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96812-4_19"},{"key":"4_CR37","unstructured":"Nipkow, T.: Boolean expression checkers. Arch. Formal Proofs (2014)"},{"key":"4_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10542-0","volume-title":"Concrete Semantics","author":"T Nipkow","year":"2014","unstructured":"Nipkow, T., Klein, G.: Concrete Semantics. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10542-0"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"4_CR40","unstructured":"Nishihara, T., Minamide, Y.: Depth first search. Arch. Formal Proofs (2004)"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-51054-1_30","volume-title":"Automated Reasoning","author":"G Passmore","year":"2020","unstructured":"Passmore, G., et al.: The Imandra automated reasoning system (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 464\u2013471. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_30"},{"key":"4_CR42","unstructured":"Rau, M.: Multidimensional binary search trees. Arch. Formal Proofs (2019)"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-030-29436-6_28","volume-title":"Automated Deduction \u2013 CADE 27","author":"G Reger","year":"2019","unstructured":"Reger, G., Voronkov, A.: Induction in saturation-based proof search. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 477\u2013494. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_28"},{"key":"4_CR44","unstructured":"Schirmer, N.: A sequential imperative programming language syntax, semantics, Hoare logics and verification environment. Arch. Formal Proofs (2008)"},{"key":"4_CR45","unstructured":"Sickert, S.: Linear temporal logic. Arch. Formal Proofs (2016)"},{"key":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-71067-7_6","volume-title":"Theorem Proving in Higher Order Logics","author":"K Slind","year":"2008","unstructured":"Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28\u201332. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_6"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09827-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T23:14:44Z","timestamp":1656026084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09827-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098260","9783031098277"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09827-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nantes","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","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":"tap2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/TAP22\/index.html","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":"11","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":"6","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":"1","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":"55% - 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":"2","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)"}}]}}