{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:25Z","timestamp":1725663505208},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:07:35Z","timestamp":1330236455000},"page":"168-174","source":"Crossref","is-referenced-by-count":5,"title":["Path orderings for termination of associative-commutative rewriting"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subrata","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Leo Bachmair. Associative-commutative reduction orderings. Information Processing Letters. To appear.","DOI":"10.1016\/0020-0190(92)90024-P"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(85)80019-5","volume":"1","author":"L. Bachmair","year":"1985","unstructured":"Leo Bachmair and David A. Plaisted. Termination orderings for associative-commutative rewrite systems. J. of Symbolic Computation, vol. 1, pages 329\u2013349 (1985).","journal-title":"J. of Symbolic Computation"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. B. Cherifa","year":"1987","unstructured":"Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, vol. 9, pages 137\u2013159 (1987).","journal-title":"Science of Computer Programming"},{"volume-title":"Garmisch-Partenkirchen","year":"1982","key":"13_CR4","unstructured":"Dines Bjorner, editor. Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts-II. Garmisch-Partenkirchen, West Germany, North-Holland 1982."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz. Termination of rewriting. J. of Symbolic Computation, vol. 3, pages 69\u2013116 (1987).","journal-title":"J. of Symbolic Computation"},{"key":"13_CR6","unstructured":"Nachum Dershowitz and Jieh Hsiang and N. Alan Josephson and David A. Plaisted. Associative-commutative rewriting. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, pages 940\u2013944, 1983."},{"key":"13_CR7","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 243\u2013320, North-Holland, Amsterdam, 1990."},{"key":"13_CR8","first-page":"133","volume-title":"vol. 472 of Lecture Notes in Computer Science","author":"D. Kapur","year":"1990","unstructured":"Deepak Kapur, G. Sivakumar and Hantao Zhang. A new method for proving termination of AC-rewrite systems. In Proceedings of the Tenth International Conference of Foundations of Software Technology and Theoretical Computer Science, vol. 472 of Lecture Notes in Computer Science, pages 133\u2013148, Springer-Verlag, Berlin, 1990."},{"key":"13_CR9","volume-title":"Memo MTP-3","author":"Dallas S. S. Lankford","year":"1979","unstructured":"Dallas S. Lankford. On proving term rewriting systems are Noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, 1979."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:18Z","timestamp":1619556618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}