{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:38Z","timestamp":1725487658079},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657651"},{"type":"electronic","value":"9783540489580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48958-4_19","type":"book-chapter","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T02:11:42Z","timestamp":1185156702000},"page":"313-315","source":"Crossref","is-referenced-by-count":0,"title":["Abstract: Proof Planning with Program Schemas"],"prefix":"10.1007","author":[{"given":"Julian","family":"Richardson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"19_CR1","unstructured":"A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In S. L.H. Clarke, editor, Proceedings of UK IT 90, pages 221\u20136. IEE, 1990. Also available from Edinburgh as DAI Research Paper 448."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0004-3702(93)90079-Q","volume":"62","author":"A. Bundy","year":"1993","unstructured":"A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185\u2013253, 1993. Also available from Edinburgh as DAI Research Paper No. 567.","journal-title":"Artificial Intelligence"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","volume-title":"LOPSTR\u2019 97: Proceedings of the Seventh International Workshop on Logic Program Synthesis and Transformation, Leuven, Belgium, July 10\u201312 1997","author":"P. Flener","year":"1998","unstructured":"P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In N. E. Fuchs, editor, LOPSTR\u2019 97: Proceedings of the Seventh International Workshop on Logic Program Synthesis and Transformation, Leuven, Belgium, July 10\u201312 1997, volume 1463 of Lecture Notes in Computer Science. Springer Verlag, 1998."},{"key":"19_CR4","unstructured":"J.D.C. Richardson. Proof planning with program schemas. Research Paper, School of Artificial Intelligence, University of Edinburgh. Forthcoming."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CADE-15","author":"J.D.C. Richardson","year":"1998","unstructured":"J.D.C Richardson, A. Smaill, and I.M. Green. System description: proof planning in higher-order logic with lambdaclam. In C. Kirchner and H. Kirchner, editors, Proceedings of CADE-15, volume 1421 of Lecture Notes in Computer Science. Springer Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48958-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:11:19Z","timestamp":1550477479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48958-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657651","9783540489580"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-48958-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}