{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:01:48Z","timestamp":1768280508476,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9421,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1016\/0167-6423(87)90030-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"137-159","source":"Crossref","is-referenced-by-count":112,"title":["Termination of rewriting systems by polynomial interpretations and its implementation"],"prefix":"10.1016","volume":"9","author":[{"given":"Ahlem","family":"Ben Cherifa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90030-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(85)80019-5","article-title":"Termination orderings for associative-commutative rewriting systems","author":"Bachmair","year":"1985","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0167-6423(87)90030-X_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6423(86)90017-1","article-title":"Rewriting systems on FP expressions to reduce the number of sequences yielded","volume":"6","author":"Bellegarde","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(87)90030-X_BIB3","article-title":"Transformation ordering","author":"Bellgarde","year":"1987","journal-title":"Proc. CAAP '87"},{"key":"10.1016\/0167-6423(87)90030-X_BIB4","series-title":"Th\u00e8se","article-title":"Preuves de terminaison de syst\u00e8mes de r\u00e9\u00e9criture: un outil fond\u00e9 sur les interpr\u00e9tations polynomiales","author":"Ben Cherifa","year":"1986"},{"key":"10.1016\/0167-6423(87)90030-X_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/cpa.3160220202","article-title":"Decision procedures for real and p-adic fields","volume":"22","author":"Cohen","year":"1969","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0167-6423(87)90030-X_BIB6","series-title":"Proc. 2nd GI Conference on Automata and Formal Languages","article-title":"Quantifier elimination for real closed fields by cylindrical algebraic decomposition","author":"Collins","year":"1975"},{"issue":"3","key":"10.1016\/0167-6423(87)90030-X_BIB7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2318447","article-title":"Hilbert's tenth problem is unsolvable","volume":"80","author":"Davis","year":"1973","journal-title":"Amer. Math. Month."},{"key":"10.1016\/0167-6423(87)90030-X_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(87)90030-X_BIB9","series-title":"ATR-83(8478)-3","article-title":"Well-founded orderings","author":"Dershowitz","year":"1983"},{"key":"10.1016\/0167-6423(87)90030-X_BIB10","series-title":"Proc. 1st Conference on Rewriting Techniques and Applications","first-page":"180","article-title":"Termination","volume":"202","author":"Dershowitz","year":"1985"},{"key":"10.1016\/0167-6423(87)90030-X_BIB11","series-title":"Proc. 1st International Conference on Rewriting Techniques and Applications","article-title":"An incremental algorithm for proving termination of term rewriting systems","volume":"202","author":"Forgaard","year":"1985"},{"key":"10.1016\/0167-6423(87)90030-X_BIB12","series-title":"Proc. 8th Conference on Automated Deduction","article-title":"Proving termination of associative-commutative rewriting systems by rewriting","author":"Gnaedig","year":"1986"},{"key":"10.1016\/0167-6423(87)90030-X_BIB13","series-title":"PhD Thesis","article-title":"Topics in automated theorem proving and program generation","author":"Hsiang","year":"1982"},{"issue":"4","key":"10.1016\/0167-6423(87)90030-X_BIB14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(87)90030-X_BIB15","article-title":"On the uniform halting problem for term rewriting systems","author":"Huet","year":"1978","journal-title":"Rapport Laboria 283"},{"key":"10.1016\/0167-6423(87)90030-X_BIB16","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"key":"10.1016\/0167-6423(87)90030-X_BIB17","article-title":"Completion of a set of rules modulo a set of equations","author":"Jouannaud","year":"1984","journal-title":"Proc. 11th ACM Conference on Principles of Programming Languages"},{"issue":"4","key":"10.1016\/0167-6423(87)90030-X_BIB18","doi-asserted-by":"crossref","DOI":"10.1137\/0215084","article-title":"Completion of a set of rules modulo a set of equations","volume":"15","author":"Jouannaud","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(87)90030-X_BIB19","series-title":"Formal Description of Programming Concepts 2","first-page":"331","article-title":"Recursive decomposition ordering","author":"Jouannaud","year":"1982"},{"key":"10.1016\/0167-6423(87)90030-X_BIB20","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0167-6423(87)90030-X_BIB21","series-title":"Report Mtp-3","article-title":"On proving term rewriting systems are noetherian","author":"Lankford","year":"1979"},{"key":"10.1016\/0167-6423(87)90030-X_BIB22","first-page":"99","article-title":"Computer experiments with the REVE term rewriting system generator","author":"Lescanne","year":"1983","journal-title":"Proc. 10th ACM Conference on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(87)90030-X_BIB23","first-page":"789","article-title":"On the termination of Markov algorithms","author":"Manna","year":"1970","journal-title":"Proc. 3rd Hawaii International Conference on System Sciences"},{"key":"10.1016\/0167-6423(87)90030-X_BIB24","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-17220-3_4","article-title":"How to choose the weights in the Knuth-Bendix ordering","author":"Martin","year":"1987","journal-title":"Proc. 2nd Conference on Rewriting Techniques and Applications"},{"issue":"2","key":"10.1016\/0167-6423(87)90030-X_BIB25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","article-title":"Complete sets of reduction for equational theories with complete unification algorithms","volume":"28","author":"Peterson","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(87)90030-X_BIB26","series-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski","year":"1951"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238790030X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238790030X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:51:02Z","timestamp":1555091462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764238790030X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["016764238790030X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90030-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}