{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:30Z","timestamp":1725664530407},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593409"},{"type":"electronic","value":"9783540492375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59340-3_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:14:39Z","timestamp":1330258479000},"page":"16-26","source":"Crossref","is-referenced-by-count":21,"title":["33 Examples of termination"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"2_CR1","unstructured":"Nachum Dershowitz and Charles Hoot. Natural termination. Theoretical Computer Science, to appear."},{"key":"2_CR2","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243\u2013320. North-Holland, Amsterdam, 1990."},{"issue":"8","key":"2_CR3","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465\u2013476, August 1979.","journal-title":"Communications of the ACM"},{"issue":"3","key":"2_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, March 1982.","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"2_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. Symbolic Computation, 3(1&2):69\u2013115, February\/April 1987. Corrigendum: 4, 3 (December 1987), 409\u2013410; reprinted in Rewriting Techniques and Applications, J.-P. Jouannaud, ed., pp. 69\u2013115, Academic Press, 1987.","journal-title":"J. Symbolic Computation"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1017\/S0305004100027092","volume":"47","author":"T. Evans","year":"1951","unstructured":"Trevor Evans. On multiplicative systems defined by generators and relations, I. Proceedings of the Cambridge Philosophical Society, 47:637\u2013649, 1951.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"issue":"6","key":"2_CR7","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/0016-0032(73)90303-7","volume":"296","author":"S. Gorn","year":"1973","unstructured":"Saul Gorn. On the conclusive validation of symbol manipulation processes (how do you know it has to work?). J. of the Franklin Institute, 296(6):499\u2013518, December 1973.","journal-title":"J. of the Franklin Institute"},{"key":"2_CR8","volume-title":"Ph.D. Thesis","author":"R. Iturriaga","year":"1967","unstructured":"R. Iturriaga. Contributions to mechanical mathematics. Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1967."},{"key":"2_CR9","volume-title":"Two generalizations of the recursive path ordering","author":"S. Kamin","year":"1980","unstructured":"Sam Kamin and Jean-Jacques L\u00e9vy. Two generalizations of the recursive path ordering. Unpublished note, Department of Computer Science, University of Illinois, Urbana, IL, February 1980."},{"key":"2_CR10","first-page":"1","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J. W. Klop","year":"1992","unstructured":"Jan Willem Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1\u2013117. Oxford University Press, Oxford, 1992."},{"key":"2_CR11","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Donald E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, Oxford, U. K., 1970. Reprinted in Automation of Reasoning 2, Springer-Verlag, Berlin, pp. 342\u2013376 (1983)."},{"key":"2_CR12","volume-title":"Memo MTP-3","author":"D. 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, May 1979. Revised October 1979."},{"key":"2_CR13","unstructured":"R. Lipton and L. Snyder. On the halting of tree replacement systems. In Proceedings of the Conference on Theoretical Computer Science, pages 43\u201346, Waterloo, Canada, August 1977."},{"key":"2_CR14","unstructured":"Zohar Manna and Steven Ness. On the termination of Markov algorithms. In Proceedings of the Third Hawaii International Conference on System Science, pages 789\u2013792, Honolulu, HI, January 1970."},{"key":"2_CR15","volume-title":"Report R-78-932","author":"D. A. Plaisted","year":"1978","unstructured":"David A. Plaisted. Well-founded orderings for proving termination of systems of rewrite rules. Report R-78-932, Department of Computer Science, University of Illinois, Urbana, IL, July 1978."},{"key":"2_CR16","volume-title":"Report R-78-943","author":"D. A. Plaisted","year":"1978","unstructured":"David A. Plaisted. A recursively defined ordering for proving termination of term rewriting systems. Report R-78-943, Department of Computer Science, University of Illinois, Urbana, IL, September 1978."},{"key":"2_CR17","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4","author":"D. A. Plaisted","year":"1993","unstructured":"David A. Plaisted. Term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, chapter 2. Oxford University Press, Oxford, 1993. To appear."},{"key":"2_CR18","volume-title":"Technical Report RUU-CS-91-42","author":"H. Zantema","year":"1991","unstructured":"Hans Zantema. Classifying termination of term rewriting. Technical Report RUU-CS-91-42, Utrecht University, The Netherlands, November 1991."}],"container-title":["Lecture Notes in Computer Science","Term Rewriting"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59340-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:27:12Z","timestamp":1619558832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59340-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593409","9783540492375"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-59340-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}