{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:41:15Z","timestamp":1781836875934,"version":"3.54.5"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319968117","type":"print"},{"value":"9783319968124","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96812-4_19","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T04:26:41Z","timestamp":1531801601000},"page":"225-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Goal-Oriented Conjecturing for\u00a0Isabelle\/HOL"],"prefix":"10.1007","author":[{"given":"Yutaka","family":"Nagashima","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Parsert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Blanchette, J.C.: Nitpick: a counterexample generator for Isabelle\/HOL based on the relational model finder Kodkod. In: LPAR-17, pp. 20\u201325 (2010)","DOI":"10.1007\/978-3-642-14052-5_11"},{"key":"19_CR2","unstructured":"Buchberger, B.: Theory exploration with theorema (2000)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-35308-6_10","volume-title":"Certified Programs and Proofs","author":"L Bulwahn","year":"2012","unstructured":"Bulwahn, L.: The new quickcheck for Isabelle. In: Hawblitzel, C., Miller, D. (eds.) CPP 2012. LNCS, vol. 7679, pp. 92\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35308-6_10"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-662-48899-7_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T Gauthier","year":"2015","unstructured":"Gauthier, T., Kaliszyk, C.: Sharing HOL4 and HOL light proof knowledge. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 372\u2013386. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_26"},{"key":"19_CR5","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J.: Initial experiments with statistical conjecturing over large formal corpora, pp. 219\u2013228 (2016). http:\/\/ceur-ws.org\/Vol-1785\/W23.pdf"},{"issue":"3","key":"19_CR6","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. J. Autom. Reason. 47(3), 251\u2013289 (2011)","journal-title":"J. Autom. Reason."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-08434-3_9","volume-title":"Intelligent Computer Mathematics","author":"M Johansson","year":"2014","unstructured":"Johansson, M., Ros\u00e9n, D., Smallbone, N., Claessen, K.: Hipster: integrating theory exploration in a proof assistant. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 108\u2013122. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3_9"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-319-63046-5_32","volume-title":"Automated Deduction \u2013 CADE 26","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.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 528\u2013545. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_32"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9","DOI":"10.1007\/3-540-45949-9"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96812-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T18:31:02Z","timestamp":1571596262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96812-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968117","9783319968124"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96812-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}