{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:41Z","timestamp":1725516221293},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_24","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"351-365","source":"Crossref","is-referenced-by-count":2,"title":["Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities"],"prefix":"10.1007","author":[{"given":"Sorin","family":"Stratulat","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11805618_18","volume-title":"Term Rewriting and Applications","author":"T. Aoto","year":"2006","unstructured":"Aoto, T.: Dealing with non-orientable equations in rewriting induction. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 242\u2013256. Springer, Heidelberg (2006)"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/jsco.2002.0549","volume":"34","author":"A. Armando","year":"2002","unstructured":"Armando, A., Rusinowitch, M., Stratulat, S.: Incorporating decision procedures in implicit induction. J. Symb. Comput.\u00a034(4), 241\u2013258 (2002)","journal-title":"J. Symb. Comput."},{"key":"24_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"24_CR4","first-page":"1","volume-title":"Resolution of Equations in Algebraic Structure","author":"L. Bachmair","year":"1989","unstructured":"Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Resolution of Equations in Algebraic Structure, vol.\u00a02, pp. 1\u201330. Academic Press, London (1989)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44881-0_24","volume-title":"Rewriting Techniques and Applications","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., Stratulat, S.: Validation of the JavaCard platform with implicit induction techniques. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 337\u2013351. Springer, Heidelberg (2003)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jsco.1996.0076","volume":"23","author":"A. Bouhoula","year":"1997","unstructured":"Bouhoula, A.: Automated theorem proving by test set induction. Journal of Symbolic Computation\u00a023, 47\u201377 (1997)","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/logcom\/5.5.631","volume":"5","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Kounalis, E., Rusinowitch, M.: Automated mathematical induction. Journal of Logic and Computation\u00a05(5), 631\u2013668 (1995)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881856","volume":"14","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning\u00a014(2), 189\u2013235 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The automation of proof by mathematical induction. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 845\u2013911. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"24_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"key":"24_CR12","first-page":"263","volume-title":"Computational problems in abstract algebra","author":"D. Knuth","year":"1970","unstructured":"Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech (ed.) Computational problems in abstract algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"key":"24_CR13","unstructured":"Lankford, D.S.: Some remarks on inductionless induction. Technical Report MTP-11, Louisiana Tech University, Ruston, LA (1980)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Reddy, U.: Term rewriting induction. In: 10th International Conference on Automated Deduction. LNCS, vol.\u00a0814, pp. 162\u2013177 (1990)","DOI":"10.1007\/3-540-52885-7_86"},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/A:1023251327012","volume":"30","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Stratulat, S., Klay, F.: Mechanical verification of an ideal incremental ABR conformance algorithm. J. Autom. Reasoning\u00a030(2), 53\u2013177 (2003)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jsco.2000.0469","volume":"32","author":"S. Stratulat","year":"2001","unstructured":"Stratulat, S.: A general framework to build contextual cover set induction provers. Journal of Symbolic Computation\u00a032(4), 403\u2013445 (2001)","journal-title":"Journal of Symbolic Computation"},{"key":"24_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11554554_20","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"S. Stratulat","year":"2005","unstructured":"Stratulat, S.: Automatic \u2018Descente Infinie\u2019 induction reasoning. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol.\u00a03702, pp. 262\u2013276. Springer, Heidelberg (2005)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/SYNASC.2007.17","volume-title":"SYNASC 2007: Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007)","author":"S. Stratulat","year":"2007","unstructured":"Stratulat, S.: \u2018Descente Infinie\u2019 induction-based saturation procedures. In: SYNASC 2007: Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), Washington, DC, USA, pp. 17\u201324. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/jigpal\/12.1.1","volume":"12","author":"C.-P. Wirth","year":"2004","unstructured":"Wirth, C.-P.: Descente infinie + deduction. Logic Journal of the IGPL\u00a012(1), 1\u201396 (2004)","journal-title":"Logic Journal of the IGPL"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:53Z","timestamp":1620015833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}