{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:15:18Z","timestamp":1773479718078,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642452208","type":"print"},{"value":"9783642452215","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_27","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T04:28:23Z","timestamp":1386217703000},"page":"389-406","source":"Crossref","is-referenced-by-count":27,"title":["Proof-Pattern Recognition and Lemma Discovery in ACL2"],"prefix":"10.1007","author":[{"given":"J\u00f3nathan","family":"Heras","sequence":"first","affiliation":[]},{"given":"Ekaterina","family":"Komendantskaya","sequence":"additional","affiliation":[]},{"given":"Moa","family":"Johansson","sequence":"additional","affiliation":[]},{"given":"Ewen","family":"Maclean","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Basin, D., Bundy, A., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511543326"},{"key":"27_CR2","unstructured":"Bishop, C.: Pattern Recognition and Machine Learning. Springer (2006)"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jal.2005.10.006","volume":"4","author":"B. Buchberger","year":"2006","unstructured":"Buchberger, B., et al.: Theorema: towards computer-aided mathematical theory exploration. Journal of Applied Logic\u00a04(4), 470\u2013504 (2006)","journal-title":"Journal of Applied Logic"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-38574-2_27","volume-title":"Automated Deduction \u2013 CADE-24","author":"K. Claessen","year":"2013","unstructured":"Claessen, K., Johansson, M., Ros\u00e9n, D., Smallbone, N.: Automating inductive proofs using theory exploration. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol.\u00a07898, pp. 392\u2013406. Springer, Heidelberg (2013)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-13977-2_3","volume-title":"Tests and Proofs","author":"K. Claessen","year":"2010","unstructured":"Claessen, K., Smallbone, N., Hughes, J.: QuickSpec: Guessing formal specifications using testing. In: Fraser, G., Gargantini, A. (eds.) TAP 2010. LNCS, vol.\u00a06143, pp. 6\u201321. Springer, Heidelberg (2010)"},{"key":"27_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45620-1_24","volume-title":"Automated Deduction - CADE-18","author":"S. Colton","year":"2002","unstructured":"Colton, S.: The HR Program for Theorem Generation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 285\u2013289. Springer, Heidelberg (2002)"},{"key":"27_CR7","unstructured":"Denzinger, J., Fuchs, M., Goller, C., Schulz, S.: Learning from previous proof experience: A survey. Technical report, Technische Universitat Munchen (1999)"},{"issue":"1-2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1999.2857","volume":"162","author":"J. Denzinger","year":"2000","unstructured":"Denzinger, J., Schulz, S.: Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts. Inform. and Comput.\u00a0162(1-2), 59\u201379 (2000)","journal-title":"Inform. and Comput."},{"key":"27_CR9","unstructured":"Duncan, H.: The use of Data-Mining for the Automatic Formation of Tactics. PhD thesis, University of Edinburgh (2002)"},{"key":"27_CR10","unstructured":"Heras, J., et al.: ACL2(ml): downloadable programs, manual, examples (2013), \n                  \n                    http:\/\/staff.computing.dundee.ac.uk\/jheras\/acl2ml"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-28717-6_19","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Hetzl","year":"2012","unstructured":"Hetzl, S., Leitsch, A., Weller, D.: Towards algorithm cut-introduction. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 228\u2013242. Springer, Heidelberg (2012)"},{"key":"27_CR12","unstructured":"Moore, J.: Proving theorems about Java and the JVM with ACL2. In: Models, Algebras and Logic of Engineering Software, pp. 227\u2013290. IOS Press (2003)"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10817-010-9193-y","volume":"47","author":"M. Johansson","year":"2011","unstructured":"Johansson, M., Dixon, L., Bundy, A.: Conjecture synthesis for inductive theories. JAR\u00a047(3), 251\u2013289 (2011)","journal-title":"JAR"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4615-4449-4"},{"key":"27_CR15","unstructured":"Kaufmann, M., Moore, J.S.: How to Prove Theorems Formally (2005), \n                  \n                    http:\/\/www.cs.utexas.edu\/users\/moore\/publications\/how-to-prove-thms\/main.ps"},{"key":"27_CR16","unstructured":"Kaufmann, M., Moore, J.S.: ACL2 version 6.2 (2013), \n                  \n                    http:\/\/www.cs.utexas.edu\/users\/moore\/acl2\/"},{"key":"27_CR17","first-page":"15","volume":"118","author":"E. Komendantskaya","year":"2013","unstructured":"Komendantskaya, E., Heras, J., Grov, G.: Machine Learning for Proof General: interfacing interfaces. ENTCS\u00a0118, 15\u201341 (2013)","journal-title":"ENTCS"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-31365-3_30","volume-title":"Automated Reasoning","author":"D. K\u00fchlwein","year":"2012","unstructured":"K\u00fchlwein, D., et al.: Overview and evaluation of premise selection techniques for large theory mathematics. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol.\u00a07364, pp. 378\u2013392. Springer, Heidelberg (2012)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00edn-Mateos, F.J., et al.: ACL2 verification of simplicial degeneracy programs in the Kenzo system. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus\/MKM 2009. LNCS (LNAI), vol.\u00a05625, pp. 106\u2013121. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02614-0_13"},{"issue":"1","key":"27_CR20","first-page":"21","volume":"151","author":"R.L. McCasland","year":"2006","unstructured":"McCasland, R.L., Bundy, A., Smith, P.F.: Ascertaining mathematical theorems. ENTCS\u00a0151(1), 21\u201338 (2006)","journal-title":"ENTCS"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1016\/j.eswa.2011.06.055","volume":"39","author":"O. Montano-Rivas","year":"2012","unstructured":"Montano-Rivas, O., et al.: Scheme-based theorem discovery and concept invention. Expert Syst. Appl.\u00a039(2), 1637\u20131646 (2012)","journal-title":"Expert Syst. Appl."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Tsivtsivadze, E., Urban, J., Geuvers, H., Heskes, T.: Semantic graph kernels for automated reasoning. In: SDM 2011, pp. 795\u2013803 (2011)","DOI":"10.1137\/1.9781611972818.68"},{"key":"27_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-71070-7_37","volume-title":"Automated Reasoning","author":"J. Urban","year":"2008","unstructured":"Urban, J., et al.: Malarea sg1- machine learner for automated reasoning with semantic guidance. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 441\u2013456. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45221-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T00:28:42Z","timestamp":1558744122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}