{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:07:58Z","timestamp":1725890878489},"publisher-location":"London","reference-count":11,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198062"},{"type":"electronic","value":"9781447135609"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3560-9_4","type":"book-chapter","created":{"date-parts":[[2012,12,30]],"date-time":"2012-12-30T01:49:46Z","timestamp":1356832186000},"page":"46-60","source":"Crossref","is-referenced-by-count":0,"title":["A Unifying View of Structural Induction and Computation Induction for Logic Programs"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Fribourg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Ols\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Extracting and Transforming Logic Programs. Technical Report LIENS-91-4","author":"A Bouverot","year":"1991","unstructured":"Bouverot A., Extracting and Transforming Logic Programs. Technical Report LIENS-91\u20134, Laboratoire d\u2019Informatique de l\u2019Ecole Normale Sup\u00e9rieure, Paris, 1991."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"12","author":"RM Burstall","year":"1969","unstructured":"Burstall R. M., Proving Properties of Programs by Structural Induction. Comput. J., vol. 12, February 1969, pp. 41\u201348.","journal-title":"Comput. J."},{"key":"4_CR3","first-page":"293","volume-title":"Logic and Databases","author":"KL Clark","year":"1978","unstructured":"Clark K. L., Negation As Failure. In Logic and Databases, H. Gallaire and J. Minker (Eds.), Plenum Press, New York, 1978, pp. 293\u2013322."},{"key":"4_CR4","volume-title":"Imperial College","author":"KL Clark","year":"1979","unstructured":"Clark K. L., Predicate Logic as a Computational Formalism. Research Monograph 79\/59, TOC, Imperial College, 1979."},{"key":"4_CR5","first-page":"876","volume-title":"Automated Inductive Reasoning about Logic Programs. Proc. 5th Intl. Conf","author":"C Elkan","year":"1988","unstructured":"Elkan C. and McAllester D., Automated Inductive Reasoning about Logic Programs. Proc. 5th Intl. Conf. and Symp. on Logic Programming, Seatle, 1988, pp. 876\u2013892."},{"key":"4_CR6","first-page":"685","volume-title":"That use Extended Prolog Execution and Induction. Proc. 7th Intl. Conf","author":"L Fribourg","year":"1990","unstructured":"Fribourg L., Extracting Logic Programs from Proofs that use Extended Prolog Execution and Induction. Proc. 7th Intl. Conf. on Logic Programming, Jerusalem, 1990, pp. 685\u2013699."},{"key":"4_CR7","first-page":"103","volume-title":"Automatic Generation of Simplification Lemmas for Inductive Proofs. Proc. Intl. Symp","author":"L Fribourg","year":"1991","unstructured":"Fribourg L., Automatic Generation of Simplification Lemmas for Inductive Proofs. Proc. Intl. Symp. on Logic Programming, San Diego, 1991, pp. 103\u2013116."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-16492-8_96","volume-title":"3rd International Conference on Logic Programming, Lecture Notes in Computer Science 225","author":"T Kanamori","year":"1986","unstructured":"Kanamori T. and Seki H., Verification of Prolog Programs Using an Extension of Execution. In ( Shapiro E., ed.) 3rd International Conference on Logic Programming, Lecture Notes in Computer Science 225, 1986, pp. 475\u2013489."},{"issue":"7","key":"4_CR9","first-page":"528","volume":"15","author":"Z Manna","year":"1972","unstructured":"Manna Z. and Vuillemin J., Fixpoint Approach to the Theory of Computation. Commun. Ass. Comput. Mach., vol. 15, no. 7, 1972, pp. 528\u2013536","journal-title":"Commun. Ass. Comput. Mach."},{"key":"4_CR10","first-page":"4","volume-title":"Ieee Transactions on Software Enginering, vol. SE-2, no","author":"C Reynolds","year":"1976","unstructured":"Reynolds C. and Yeh R. T., Induction as the Basis for Program Verification. In IEEE Transactions on Software Enginering, vol. SE-2, no. 4, December 1976."},{"key":"4_CR11","first-page":"215","volume-title":"Theory of Recursive Functions and Effective Com-putability. N.Y., McGraw-Hill, th Ieee Symp","author":"HR Rogers","year":"1967","unstructured":"Rogers H.R., Theory of Recursive Functions and Effective Com-putability. N.Y., McGraw-Hill, th IEEE Symp. on Logic Programming, San Fransisco, 1967, pp. 215\u2013223."}],"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-3560-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T22:56:43Z","timestamp":1557442603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3560-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198062","9781447135609"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3560-9_4","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}