{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:13Z","timestamp":1725488893234},"publisher-location":"London","reference-count":13,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197423"},{"type":"electronic","value":"9781447134947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3494-7_3","type":"book-chapter","created":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T04:16:55Z","timestamp":1362111415000},"page":"27-45","source":"Crossref","is-referenced-by-count":4,"title":["Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof"],"prefix":"10.1007","author":[{"given":"Geraint","family":"Wiggins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ina","family":"Kraan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Bundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jane","family":"Hesketh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"W. Bibel and K.M. Horning. Lops \u2014 a system based on a strategical approach to program synthesis. In A. Biermann, G. Guiho, and Y. Kodratoff, editors, Automatic Program Construction Techniques, pages 69-90. MacMillan, 1984."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"88] A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th Conference on Automated Deduction, pages 111-120. Springer-Verlag, 1988. Longer version available from Edinburgh as Research Paper No. 349.","DOI":"10.1007\/BFb0012826"},{"key":"3_CR3","unstructured":"[Bundy et al 88]_A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Research Paper 413, Dept. of Artificial Intelligence, Edinburgh, 1988. To appear in JAR."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"[Bundy et al 90a]_A. Bundy, A. Smaill, and G. Wiggins. The synthesis of logic programs from inductive proofs. In J. Lloyd, editor, Computational Logic, pages 135-149. Springer-Verlag, 1990. Esprit Basic Research Series. Also available from Edinburgh as DAI Research Paper 501.","DOI":"10.1007\/978-3-642-76274-1_8"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"[Bundy et al 90b]_A. Bundy, F. van Harmelen, A. Smaill, and A. Ireland. Extensions to the rippling-out tactic for guiding inductive proofs. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 132-146. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449.","DOI":"10.1007\/3-540-52885-7_84"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"[Bundy et al 90c]_A. Bundy, van Harmelen. F., C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647-648, Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449.","DOI":"10.1007\/3-540-52885-7_123"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"[Bundy et al 91]_A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 1991. In press. Earlier version available from Edinburgh as Research Paper No 413.","DOI":"10.1007\/BF00249016"},{"key":"3_CR8","unstructured":"[Bundy et al ng]_A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Research paper, Dept. of Artificial Intelligence, Edinburgh, forthcoming."},{"key":"3_CR9","unstructured":"R.L. Constable. Programs as proofs. Technical Report TR 82-532, Dept. of Computer Science, Cornell University, November 1982."},{"key":"3_CR10","unstructured":"L. Fribourg. Extracting logic programs from proofs that use extended prolog execution and induction. In Proceedings of Eighth International Conference on Logic Programming, pages 685\u2013699. MIT Press, June 1990."},{"key":"3_CR11","unstructured":"C. Horn. The Nurprl proof development system. Working paper 214, Dept. of Artificial Intelligence, Edinburgh, 1988. The Edinburgh version of Nurprl has been renamed Oyster."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"P. Madden. Automated Program Transformation Through Proof Transformation. Unpublished PhD thesis, University of Edinburgh, 1991.","DOI":"10.1007\/3-540-55602-8_183"},{"key":"3_CR13","unstructured":"G. Wiggins. The improvement of prolog program efficiency by compiling control: A proof-theoretic view. In Proceedings of the Second International Workshop on Meta-programming in Logic, Leuven, Beglium, April 1990. Also available from Edinburgh as DAI Research Paper No. 455."}],"container-title":["Workshops in Computing","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3494-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T18:46:16Z","timestamp":1644432376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3494-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197423","9781447134947"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3494-7_3","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}