{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:56Z","timestamp":1750306676335,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T00:00:00Z","timestamp":1410134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,9,8]]},"DOI":"10.1145\/2643135.2643156","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T14:04:29Z","timestamp":1436191469000},"page":"237-248","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Decision Procedures for Proving Inductive Theorems without Induction"],"prefix":"10.1145","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[{"name":"RIEC, Tohoku University"}]},{"given":"Sorin","family":"Stratulat","sequence":"additional","affiliation":[{"name":"LITA, University of Lorraine"}]}],"member":"320","published-online":{"date-parts":[[2014,9,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00236-0"},{"key":"e_1_3_2_1_2_1","series-title":"RISC Technical Report","first-page":"1","volume-title":"Proc. of 1st SCSS","author":"Aoto T.","year":"2008"},{"key":"e_1_3_2_1_3_1","series-title":"LIPIcs","first-page":"13","volume-title":"Proc. of 28th FSTTCS","author":"Aoto T.","year":"2008"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0549"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_6_1","first-page":"15","volume-title":"Proc. of 4th IJCAI","author":"Bledsoe W. W.","year":"1975"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/5.5.631"},{"key":"e_1_3_2_1_8_1","first-page":"83","volume-title":"Machine Intelligence","author":"Boyer R. S.","year":"1988"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258583"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"R. D.\n       \n      Cosmo\n     and \n      \n      \n      T.\n       \n      Dufour\n      \n  \n  . \n  The equational theory of ⟨N 0 1 + \u00d7 ↑&rang\n  ; is decidable but not finitely axiomatisable. In Proc. of 11th LPAR volume \n  3452\n   of \n  LNAI pages \n  240\n  --\n  256\n  . \n  Springer-Verlag 2004\n  .  R. D. Cosmo and T. Dufour. The equational theory of ⟨N 0 1 + \u00d7 ↑⟩ is decidable but not finitely axiomatisable. In Proc. of 11th LPAR volume 3452 of LNAI pages 240--256. Springer-Verlag 2004.","DOI":"10.1007\/978-3-540-32275-7_17"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11916277_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_20"},{"key":"e_1_3_2_1_13_1","series-title":"LNAI","first-page":"469","volume-title":"Proc. of 1st IJCAR","author":"Giesl J.","year":"2001"},{"key":"e_1_3_2_1_14_1","series-title":"LNAI","first-page":"17","volume-title":"Proc. of CADE-19","author":"Giesl J.","year":"2003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.01.006"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1985-0781071-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540610"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.9"},{"volume-title":"Stanford University","year":"1980","author":"Huet G.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","first-page":"81","article-title":"New uses of linear arithmetic in automated theorem proving by induction","volume":"2","author":"Kapur D.","year":"1991","journal-title":"Journal of Automated Reasoning, 1--"},{"key":"e_1_3_2_1_21_1","series-title":"LNAI","first-page":"324","volume-title":"Proc. of CADE-17","author":"Kapur D.","year":"2000"},{"issue":"2","key":"e_1_3_2_1_22_1","first-page":"278","article-title":"Dokl","volume":"191","author":"Matiyasevich Y.","year":"1970","journal-title":"AN SSSR"},{"issue":"3","key":"e_1_3_2_1_23_1","first-page":"294","article-title":"Decidability of inductive theorems based on rewriting induction","volume":"31","author":"Nakazima T.","year":"2014","journal-title":"JSSST Computer Software"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"T.\n       \n      Nipkow L. C.\n       \n      Paulson and \n      \n      \n      M.\n       \n      Wenzel\n      \n  \n  . \n  Isabelle\/HOL --- A Proof Assistant for Higher-Order Logic volume \n  2283\n   of \n  LNCS\n  . \n  Springer 2002\n  .   T. Nipkow L. C. Paulson and M. Wenzel. Isabelle\/HOL --- A Proof Assistant for Higher-Order Logic volume 2283 of LNCS. Springer 2002.","DOI":"10.1007\/3-540-45949-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"issue":"2","key":"e_1_3_2_1_26_1","first-page":"41","article-title":"Automated lemma generation for rewriting induction with disproof","volume":"26","author":"Shimazu S.","year":"2009","journal-title":"JSSST Computer Software"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322034"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0469"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2014.26"},{"key":"e_1_3_2_1_30_1","unstructured":"Y. Toyama. Private communication.  Y. Toyama. Private communication."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.022"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622747"},{"volume-title":"Iwanami","year":"1990","author":"Yamazaki Y.","key":"e_1_3_2_1_33_1"}],"event":{"name":"PPDP '14: 16th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Canterbury United Kingdom","acronym":"PPDP '14"},"container-title":["Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2643135.2643156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:01Z","timestamp":1750230061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,8]]},"references-count":33,"alternative-id":["10.1145\/2643135.2643156","10.1145\/2643135"],"URL":"https:\/\/doi.org\/10.1145\/2643135.2643156","relation":{},"subject":[],"published":{"date-parts":[[2014,9,8]]},"assertion":[{"value":"2014-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}