{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:18Z","timestamp":1725663498036},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:07:12Z","timestamp":1330254432000},"page":"175-197","source":"Crossref","is-referenced-by-count":0,"title":["Generic induction proofs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Padawitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud, Rewrite Systems, in: J. van Leeuwen, Handbook of Theoretical Computer Science, Elsevier (1990) 243\u2013320","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"14_CR2","unstructured":"D. Duffy, Principles of Automated Theorem Proving, John Wiley & Sons 1991"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer 1985","DOI":"10.1007\/978-3-642-69962-7"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"P. Padawitz, Computing in Horn Clause Theories, Springer 1988","DOI":"10.1007\/978-3-642-73824-1"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00249354","volume":"7","author":"P. Padawitz","year":"1991","unstructured":"P. Padawitz, Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic programs, Journal of Automated Reasoning 7 (1991) 27\u2013103","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1093\/comjnl\/34.1.42","volume":"34","author":"P. Padawitz","year":"1991","unstructured":"P. Padawitz, Reduction and Narrowing for Horn Clause Theories, The Computer Journal 34 (1991) 42\u201351","journal-title":"The Computer Journal"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"P. Padawitz, Deduction and Declarative Programming, Cambridge University Press 1992","DOI":"10.1017\/CBO9780511569876"},{"key":"14_CR8","unstructured":"P. Padawitz, EXPANDER: User's Manual, Universit\u00e4t Dortmund 1992"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"M. Wirsing, Algebraic Specification, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 675\u2013788","DOI":"10.1016\/B978-0-444-88074-1.50018-4"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:19Z","timestamp":1619571019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}