{"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":1761611171552},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030601","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:10:41Z","timestamp":1133399441000},"page":"249-260","source":"Crossref","is-referenced-by-count":6,"title":["Termination proofs using gpo ordering constraints"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Genet","sequence":"first","affiliation":[]},{"given":"Isabelle","family":"Gnaedig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"H. Comon. Solving inequations in term algebras. In Proc. 5th LICS Symp., Philadelphia (Pa., USA), pages 62\u201369, June 1990.","DOI":"10.1109\/LICS.1990.113734"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz and C. Hoot. Natural termination. TCS, 142(2):179\u2013207, May 1995.","journal-title":"TCS"},{"key":"20_CR3","first-page":"244","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990."},{"key":"20_CR4","first-page":"255","volume-title":"Proc. 1st RTA Conf.","author":"R. Forgaard","year":"1985","unstructured":"R. Forgaard and D. Detlefs. An incremental algorithm for proving termination of term rewriting systems. In J.-P. Jouannaud, editor, Proc. 1st RTA Conf., Dijon (France), pages 255\u2013270. Springer-Verlag, 1985."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"T. Genet and I. Gnaedig. Termination proofs using gpo ordering constraints (extended version). Technical report, INRIA, 1997. RR-3087, available at http:\/\/www.loria.fr\/equipe\/protheo.html.","DOI":"10.1007\/BFb0030601"},{"key":"20_CR6","series-title":"volume 914 of LNCS","volume-title":"Proc. 6th RTA Conf.","author":"J. Giesl","year":"1995","unstructured":"J. Giesl. Generating polynomial orderings for termination proofs. In J. Hsiang, editor, Proc. 6th RTA Conf., Kaiserslautern (Germany), volume 914 of LNCS. Springer-Verlag, 1995."},{"key":"20_CR7","series-title":"volume 845 of LNCS","first-page":"352","volume-title":"Proc. 1st CCL Conf.","author":"P. Johann","year":"1994","unstructured":"P. Johann and R. Socher-Ambrosius. Solving simplification ordering constraints. In J.-P. Jouannaud, editor, Proc. 1st CCL Conf., Munich (Germany), volume 845 of LNCS, pages 352\u2013367. Springer-Verlag, 1994."},{"key":"20_CR8","unstructured":"S. Kamin and J.-J. L\u00e9vy. Attempts for generalizing the recursive path ordering. Unpublished manuscript, 1980."},{"key":"20_CR9","volume-title":"Technical report, Louisiana Tech","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":"20_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00302640","volume":"6","author":"P. Lescanne","year":"1990","unstructured":"P. Lescanne. On the recursive decomposition ordering with lexicographical status and other related orderings. JAR, 6:39\u201349, 1990.","journal-title":"JAR"},{"key":"20_CR11","unstructured":"C. Lynch and P. Strogova. Sour graphs for efficient completion. Technical Report 95-R-343, CRIN, 1995."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis. Simple lpo constraint solving methods. IPL, 47(2), 1993.","DOI":"10.1016\/0020-0190(93)90226-Y"},{"key":"20_CR13","series-title":"volume 607 of LNCS","first-page":"477","volume-title":"Proc. 11th CADE Conf.","author":"R. Nieuwenhuis","year":"1992","unstructured":"R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In D. Kapur, editor, Proc. 11th CADE Conf., Saratoga Springs (N.Y., USA), volume 607 of LNCS, pages 477\u2013491. Springer-Verlag, 1992."},{"key":"20_CR14","first-page":"405","volume-title":"volume 690 of LNCS","author":"D. Plaisted","year":"1993","unstructured":"D. Plaisted. Polynomial time termination and constraint satisfaction tests. In C. Kirchner, editor, Proc. 5th RTA Conf., Montreal (Canada), volume 690 of LNCS, pages 405\u2013420, Montreal (Qu\u00e9bec, Canada), June 1993. Springer-Verlag."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(94)90032-9","volume":"49","author":"J. Steinbach","year":"1994","unstructured":"J. Steinbach. Generating polynomial orderings. IPL, 49:85\u201393, 1994.","journal-title":"IPL"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:20:00Z","timestamp":1586578800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0030601","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}