{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:50Z","timestamp":1725663170528},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:59:49Z","timestamp":1330196389000},"page":"42-51","source":"Crossref","is-referenced-by-count":9,"title":["An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations"],"prefix":"10.1007","author":[{"given":"Ahlem Ben","family":"Cherifa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-15976-2_11","volume-title":"Associative Path Orderings","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."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair and D.A. Plaisted, \u201dTermination Orderings For Associative-Commutative Rewriting Systems,\u201d Journal of Symbolic Computation, 1985.","DOI":"10.1016\/S0747-7171(85)80019-5"},{"key":"4_CR3","volume-title":"Symposium on LISP and Functional Programming","author":"F. Bellegarde","year":"1984","unstructured":"F. Bellegarde, \u201dRewriting Systems on FP Expressions that Reduce the Number of Sequences they yield,\u201d in Symposium on LISP and Functional Programming, ACM, Austin, USA, 1984."},{"key":"4_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":"4_CR5","volume-title":"Information Science Research Office","author":"N. Dershowitz","year":"1983","unstructured":"N. Dershowitz, \u201dWell-Founded Orderings,\u201d ATR-83(8478)-3, Information Science Research Office, The Aerospace Corporation, El Segundo, California (USA), May 1983."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15976-2_9","volume-title":"Termination","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."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"An incremental algorithm for proving termination of term rewriting systems","author":"R. Forgaard","year":"1985","unstructured":"R. Forgaard and D. Detlefs, \u201dAn incremental algorithm for proving termination of term rewriting systems,\u201d in Proc. 1rst International Conference on Rewriting Techniques and Applications., Lecture Notes in Computer Science, vol. 202, Springer Verlag, Dijon (France), 1985."},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, \u201dConfluent reductions: abstract properties and applications to term rewriting systems,\u201d J. of ACM, vol. 27, no. 4, pp. 797\u2013821, Oct. 1980.","journal-title":"J. of ACM"},{"key":"4_CR9","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":"4_CR10","first-page":"331","volume-title":"Formal Description of Programming Concepts 2","author":"J.P. Jouannaud","year":"1982","unstructured":"[Jouan.etal.82]. J.P. Jouannaud, P. Lescanne, and F. Reinig, \u201dRecursive Decomposition Ordering,\u201d in Formal Description of Programming Concepts 2, ed. Bjorner D., pp. 331\u2013346, North Holland, Garmish Partenkirschen, RFA, 1982."},{"key":"4_CR11","unstructured":"D.S. Lankford, \u201dOn Proving Term Rewriting Systems Are Noetherian,\u201d Report Mtp-3, Math. Dept., Louisiana Tech University, May 1979."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"P. Lescanne, \u201dComputer Experiments with the REVE Term Rewriting System Generator,\u201d in 10th ACM Conf. on Principles of Programming Languages, pp. 99\u2013108, Austin Texas, January 1983.","DOI":"10.1145\/567067.567078"},{"key":"4_CR13","unstructured":"Z. Manna and S. Ness, \u201dOn the Termination of Markov Algorithms,\u201d Third Hawaii International Conference on System Sciences, pp. 789\u2013792, 1970."}],"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_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:07:19Z","timestamp":1619557639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16780-3_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167808","9783540398615"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-16780-3_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}