{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:27:39Z","timestamp":1725481659137},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402541"},{"type":"electronic","value":"9783540448815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_25","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:39:56Z","timestamp":1173112796000},"page":"352-366","source":"Crossref","is-referenced-by-count":1,"title":["\u201cTerm Partition\u201d for Mathematical Induction"],"prefix":"10.1007","author":[{"given":"Urso","family":"Pascal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kounalis","family":"Emmanuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(79)90034-3","volume":"9","author":"R. Aubin","year":"1979","unstructured":"R. Aubin, Mechanizing structural induction, Theorical Computer Science 9 (1979), 329\u2013362.","journal-title":"Theorical Computer Science"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair, Proof by consistency in equational theories, Proceedings of Third IEEE LICS, 1988, pp. 228\u2013233.","DOI":"10.1109\/LICS.1988.5122"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3036","volume":"169","author":"A. Bouhoula","year":"2001","unstructured":"A. Bouhoula and J.P. Jouannaud, Automata-driven automated induction, Information and Computation 169(1) (2001), 1\u201322.","journal-title":"Information and Computation"},{"issue":"5","key":"25_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/logcom\/5.5.631","volume":"5","author":"A. Bouhoula","year":"1995","unstructured":"A. Bouhoula, E. Kounalis, and M. Rusinowitch, Automated mathematical induction, Journal of Logic and Computation 5(5) (1995), 631\u2013668.","journal-title":"Journal of Logic and Computation"},{"key":"25_CR5","volume-title":"A computational logic","author":"R.S. Boyer","year":"1979","unstructured":"R.S. Boyer and J.S. Moore, A computational logic, Academic Press, NY, 1979."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00244458","volume":"16","author":"F. Bronsard","year":"1996","unstructured":"F. Bronsard, U. Reddy, and R. Hasker, Induction using term orders, Journal of Automated Reasoning 16 (1996), 3\u201337.","journal-title":"Journal of Automated Reasoning"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"H. Comon, Inductionless induction, Handbook of Automated Reasoning (J. A. Robinson and A. Voronkov, eds.), vol. 1, Elsevier and MIT Press, 2001, pp. 913\u2013962.","DOI":"10.1016\/B978-044450813-3\/50016-3"},{"key":"25_CR8","unstructured":"N. Dershowitz, Completion and its applications, Actes du S\u00e9minaire d\u2019Informatique Th\u00e9orique (Paris), 1997."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud, Rewriting systems, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), vol. B, North-Holland, 1990, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/BF00244460","volume":"16","author":"A. Ireland","year":"1996","unstructured":"A. Ireland and A. Bundy, Using failure to guide inductive proof, Journal of Automated Reasoning 16 (1996), 38\u201385.","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","volume":"82","author":"J.P. Jouannaud","year":"1989","unstructured":"J.P. Jouannaud and E. Kounalis, Automatic proofs by induction in theories without constructor, Information and Computation 82(1) (1989), 1\u201333.","journal-title":"Information and Computation"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D. Kapur and M. Subramaniam, Lemma discovery in automating induction, Proceedings of Thirteenth Int. CADE, 1996, pp. 538\u2013552.","DOI":"10.1007\/3-540-61511-3_112"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(92)90279-O","volume":"106","author":"E. Kounalis","year":"1992","unstructured":"E. Kounalis, How to check for the ground-reducibility property in term rewriting systems, TCS 106(1) (1992), 87\u2013117.","journal-title":"TCS"},{"key":"25_CR14","unstructured":"E. Kounalis and P. Urso, Generalization discovery for proofs by induction in conditional theories, Proceedings of FLAIRS-99, AAAI Press, 1999, pp. 250\u2013256."},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1613\/jair.275","volume":"4","author":"T. Walsh","year":"1996","unstructured":"T. Walsh, A divergence critic for inductive proof, Journal of Artificial Intelligence Research 4 (1996), 209\u2013235.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"H. Zhang, D. Kapur, and M.S. Krishnamoorthy, A mechanizable induction principle for equational specification, Proceedings of Ninth Int. CADE, 1988, pp. 162\u2013181.","DOI":"10.1007\/BFb0012831"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:44:45Z","timestamp":1556171085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}