{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171627},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013817","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"21-36","source":"Crossref","is-referenced-by-count":12,"title":["Termination of rewrite systems by elementary interpretations"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Lescanne","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"542","volume-title":"Vol. 355 of Lecture Notes in Computer Science","author":"J. Avenhaus","year":"1989","unstructured":"J. Avenhaus, K. Madlener, and J. Steinbach. COMTES \u2014 an experimental environment for the completion of term rewriting systems. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, pages 542\u2013546, Chapel Hill, NC, April 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair. Canonical equational proofs. Computer Science Logic, Progress in Theoretical Computer Science. Birkh\u00e4user Verlag AG, 1991.","DOI":"10.1007\/978-1-4684-7118-2"},{"issue":"2","key":"3_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Ben Cherifa","year":"1987","unstructured":"A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137\u2013160, October 1987.","journal-title":"Science of Computer Programming"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2: Rewriting Techniques, pages 1\u201330. Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50007-9"},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computation, 1(2):79\u201396, 1990.","journal-title":"Applicable Algebra in Engineering, Communication and Computation"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(85)80019-5","volume":"1","author":"L. Bachmair","year":"1985","unstructured":"L. Bachmair and D. A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1:329\u2013349, 1985.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR7","unstructured":"E. A. Cichon and P. Lescanne. Polynomial Interpretations and the Complexity of Algorithms. Rapport interne 91-R-151, Centre de Recherche en Informatique de Nancy, Vand\u0153uvre-l\u00e8s-Nancy, 1991. to be presented at CADE'92."},{"key":"3_CR8","unstructured":"C. Delor. Terminaison des syst\u00e8mes de r\u00e9\u00e9criture, application \u00e0 la transformation des formules \u00e9quationnelles. Th\u00e8se de l'Universit\u00e9 de Paris VII, June 1991."},{"key":"3_CR9","unstructured":"N. Dershowitz and S. Mitra. RPO for AC-termination. Unpublished manuscript, U. of Illinois, 1992."},{"key":"3_CR10","unstructured":"R. Forgaard. A program for generating and analyzing term rewriting systems. Technical Report 343, Laboratory for Computer Science, Massachusetts Institute of Technology, 1984. Master's Thesis."},{"key":"3_CR11","unstructured":"A. Geser. Relative termination. Dissertation thesis, 1990."},{"key":"3_CR12","first-page":"137","volume-title":"volume 355 of Lecture Notes in Computer Science","author":"S. J. Garland","year":"1989","unstructured":"S. J. Garland and John V. Guttag. An overview of LP, the Larch Prover. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (North Carolina, USA), volume 355 of Lecture Notes in Computer Science, pages 137\u2013151. Springer-Verlag, April 1989."},{"key":"3_CR13","first-page":"52","volume-title":"volume 230 of Lecture Notes in Computer Science","author":"I. Gnaedig","year":"1986","unstructured":"I. Gnaedig and P. Lescanne. Proving termination of associative rewriting systems by rewriting. In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 52\u201361. Springer-Verlag, 1986."},{"key":"3_CR14","first-page":"54","volume-title":"volume 267 of Lecture Notes in Computer Science","author":"J. Hsiang","year":"1987","unstructured":"J. Hsiang and M. Rusinowitch. On word problem in equational theories. In Th. Ottmann, editor, Proceedings of 14th International Colloquium on Automata, Languages and Programming, Karlsruhe (Germany), volume 267 of Lecture Notes in Computer Science, pages 54\u201371. Springer-Verlag, 1987."},{"key":"3_CR15","unstructured":"S. Kamin and J.-J. L\u00e9vy. Attempts for generalizing the recursive path ordering. Unpublished manuscript, 1980."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"D. Kapur, G. Sivakumar, and H. Zhang. A new method for proving termination of AC-rewrite systems. In Proceedings 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 133\u2013148. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-53487-3_40"},{"key":"3_CR17","volume-title":"Technical report","author":"D. S. Lankford","year":"1979","unstructured":"D. S. Lankford. On proving term rewriting systems are noetherian. Technical report, Louisiana Tech. University, Mathematics Dept., Ruston LA, 1979."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"P. Lescanne. Computer experiments with the REVE term rewriting systems generator. In Proceedings of 10th ACM Symposium on Principles of Programming Languages, pages 99\u2013108. Association for Computing Machinery, 1983.","DOI":"10.1145\/567067.567078"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"P. Lescanne. Completion procedures as transition rules + control. In M. Diaz and F. Orejas, editors, TAPSOFT'89, volume 351 of Lecture Notes in Computer Science, pages 28\u201341. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-50939-9_123"},{"key":"3_CR20","first-page":"262","volume-title":"volume 463 of Lecture Notes in Computer Science","author":"P. Lescanne","year":"1990","unstructured":"P. Lescanne. Implementation of completion by transition rules + control: ORME. In H. Kirchner and W. Wechler, editors, Proceedings 2nd International Workshop on Algebraic and Logic Programming, Nancy (France), volume 463 of Lecture Notes in Computer Science, pages 262\u2013269. Springer-Verlag, 1990."},{"key":"3_CR21","unstructured":"R. P\u00e9ter. Recursive Functions. Academic Press, 1967."},{"key":"3_CR22","unstructured":"P. Weis, M. V. Aponte, A. Laville, M. Mauny, and A. Su\u00e1rez. The CAML reference manual. Technical report, Projet Formel, INRIA-ENS, 1989. Version 2.6."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:34:04Z","timestamp":1586579644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0013817","relation":{},"subject":[]}}