{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:14Z","timestamp":1725664394188},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603818"},{"type":"electronic","value":"9783540455134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60381-6_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:23:37Z","timestamp":1330280617000},"page":"353-373","source":"Crossref","is-referenced-by-count":5,"title":["Abstract notions and inference systems for proofs by mathematical induction"],"prefix":"10.1007","author":[{"given":"Claus-Peter","family":"Wirth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Leo Bachmair (1988). Proof by Consistency in Equational Theories. 3rd IEEE symposium on Logic In Computer Science, pp. 228\u2013233.","DOI":"10.1109\/LICS.1988.5122"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Klaus Becker (1993). Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications. TAPSOFT 1993, LNCS 668, pp. 46\u201360, Springer.","DOI":"10.1007\/3-540-56610-4_55"},{"key":"21_CR3","unstructured":"Klaus Becker (1994). Rewrite Operationalization of Clausal Specifications with Predefined Structures. PhD thesis, Fachbereich Informatik, Universit\u00e4t Kaiserslautern."},{"key":"21_CR4","unstructured":"Wolfgang Bibel, E. Eder (1993). Methods and Calculi for Deduction. In: Dov M. Gabbay, C. J. Hogger, J. A. Robinson (eds.). Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. 1, pp. 67\u2013182, Clarendon."},{"key":"21_CR5","unstructured":"Robert S. Boyer, J Strother Moore (1979). A Computational Logic. Academic Press."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Ulrich Fraus (1993). A Calculus for Conditional Inductive Theorem Proving. 3rd CTRS 1992, LNCS 656, pp. 357\u2013362, Springer.","DOI":"10.1007\/3-540-56393-8_27"},{"key":"21_CR7","unstructured":"Bernhard Gramlich (1989). Inductive Theorem Proving Using Refined Unfailing Completion Techniques. SEKI-Report SR-89-14 (SFB), Fachbereich Informatik, Universit\u00e4t Kaiserslautern. Short version in: 9th ECAI 1990, pp. 314\u2013319, Pitman."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Martin Protzen (1994). Lazy Generation of Induction Hypotheses. 12th CADE 1994, LNAI814, pp. 42\u201356, Springer.","DOI":"10.1007\/3-540-58156-1_4"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Uday S. Reddy (1990). Term Rewriting Induction. 10th CADE 1990, LNAI 449, pp. 162\u2013177, Springer.","DOI":"10.1007\/3-540-52885-7_86"},{"key":"21_CR10","unstructured":"Christoph Walther (1994). Mathematical Induction. In: Handbook of Logic in Artificial Intelligence and Logic Programming, eds. cf. above. Vol. 2, pp. 127\u2013228, Clarendon."},{"key":"21_CR11","unstructured":"Claus-Peter Wirth (1991). Inductive Theorem Proving in Theories specified by Positive\/Negative Conditional Equations. Diplomarbeit, Fachbereich Informatik, Universit\u00e4t Kaiserslautern."},{"key":"21_CR12","unstructured":"Claus-Peter Wirth, Bernhard Gramlich (1993). A Constructor-Based Approach for Positive\/Negative-Conditional Equational Specifications. 3rd CTRS 1992, LNCS 656, pp. 198\u2013212, Springer. Revised and extended version in J. Symbolic Computation (1994) 17, pp. 51\u201390, Academic Press."},{"key":"21_CR13","unstructured":"Claus-Peter Wirth, Bernhard Gramlich (1994). On Notions of Inductive Validity for First-Order Equational Clauses. 12th CADE 1994, LNAI 814, pp. 162\u2013176, Springer."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60381-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:49Z","timestamp":1605646729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60381-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603818","9783540455134"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60381-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}