{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:52Z","timestamp":1725663172087},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167808"},{"type":"electronic","value":"9783540398615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16780-3_79","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:00:00Z","timestamp":1330196400000},"page":"52-61","source":"Crossref","is-referenced-by-count":11,"title":["Proving termination of associative commutative rewriting systems by rewriting"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Gnaedig","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-15976-2_11","volume":"202","author":"L. Bachmair","year":"1985","unstructured":"L. Bachmair and D. Plaisted, \u201dAssociative Path Orderings,\u201d in Proc. 1st Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 241\u2013254, Springer Verlag, Dijon (France), 1985.","journal-title":"Proc. 1st Conference on Rewriting Techniques and Applications"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair and N. Dershowitz, \u201dCommutation, Transformation, and Termination,\u201d Inter. Report U. of Illinois, 1985.","DOI":"10.1007\/3-540-16780-3_76"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"A. Ben Cherifa and P. Lescanne, \u201dAn actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations,\u201d in CADE, 1986.","DOI":"10.1007\/3-540-16780-3_78"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz, \u201dOrderings for Term-Rewriting Systems,\u201d Theoretical Computer Science, vol. 17, pp. 279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15976-2_9","volume":"202","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz, \u201dTermination,\u201d in Proc. 1rst Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 180\u2013224, Springer Verlag, Dijon (France), May 1985.","journal-title":"Proc. 1rst Conf. Rewriting Techniques and Applications"},{"key":"5_CR6","unstructured":"I. Gnaedig, \u201dPreuves de Terminaison des Systemes de Reecriture Associatifscommutatifs: une Methode Fondee sur la Reecriture Elle-meme,\u201d These de troisieme cycle, Nancy, 1986."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"G. Huet and D. Oppen, \u201dEquations and Rewrite Rules: A Survey,\u201d in Formal Languages: Perspectives And Open Problems, ed. Book R., Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"J.P. Jouannaud and M. Mun\u00f5z, \u201dTermination of a set of rules modulo a set of equations,\u201d Proceedings 7th Conference on Automated Deduction, vol. 170, Napa Valley (California, USA), 1984.","DOI":"10.1007\/978-0-387-34768-4_11"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"D. Knuth and P. Bendix, \u201dSimple Word Problems in Universal Algebras,\u201d Computational Problems in Abstract Algebra Ed. Leech J., Pergamon Press, pp. 263\u2013297, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"5_CR10","unstructured":"D.S. Lankford, \u201dOn Proving Term Rewriting Systems Are Noetherian,\u201d Report Mtp-3, Math. Dept., Louisiana Tech University, May 1979."},{"key":"5_CR11","unstructured":"M. Mun\u00f5z, \u201dProbleme de terminaison finie des systemes de reecriture equationnels,\u201d These 3eme Cycle, Universite de Nancy 1, 1984."},{"key":"5_CR12","first-page":"123","volume-title":"An associative path ordering","author":"D.A. Plaisted","year":"1984","unstructured":"D.A. Plaisted, \u201dAn associative path ordering,\u201d in Proc. NSF Workshop on the Rewrite Rule Laboratory, pp. 123\u2013136, General Electric, Schenectady, New-York, April 1984."}],"container-title":["Lecture Notes in Computer Science","8th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16780-3_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:50:02Z","timestamp":1640915402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16780-3_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167808","9783540398615"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16780-3_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}