{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:47Z","timestamp":1750306787020,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["24500012"],"award-info":[{"award-number":["24500012"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,16]]},"DOI":"10.1145\/2505879.2505885","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"181-192","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Unifying the Knuth-Bendix, recursive path and polynomial orders"],"prefix":"10.1145","author":[{"given":"Akihisa","family":"Yamada","sequence":"first","affiliation":[{"name":"Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan"}]},{"given":"Keiichirou","family":"Kusakari","sequence":"additional","affiliation":[{"name":"Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan"}]},{"given":"Toshiki","family":"Sakabe","sequence":"additional","affiliation":[{"name":"Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"218","volume-title":"Proc. TACAS '08","author":"Ben-Amram A. M.","year":"2008","unstructured":"A. M. Ben-Amram and M. Codish . A SAT-based approach to size change termination with global ranking functions . In Proc. TACAS '08 , volume 4963 of LNCS , pages 218 -- 232 , 2008 . A. M. Ben-Amram and M. Codish. A SAT-based approach to size change termination with global ranking functions. In Proc. TACAS '08, volume 4963 of LNCS, pages 218--232, 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exs027"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9211-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11916277_3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9087-9"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"340","volume-title":"Proc. SAT '07","author":"Fuhs C.","year":"2007","unstructured":"C. Fuhs , J. Giesl , A. Middeldorp , P. Schneider-Kamp , R. Thiemann , and H. Zankl . SAT solving for termination analysis with polynomial interpretations . In Proc. SAT '07 , volume 4501 of LNCS , pages 340 -- 354 , 2007 . C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl. SAT solving for termination analysis with polynomial interpretations. In Proc. SAT '07, volume 4501 of LNCS, pages 340--354, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70590-1_8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9057-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.10.004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11805618_25"},{"key":"e_1_3_2_1_14_1","volume-title":"Two generalizations of the recursive path ordering","author":"Kamin S.","year":"1980","unstructured":"S. Kamin and J.-J. L\u00e9vy . Two generalizations of the recursive path ordering , 1980 . Unpublished note. S. Kamin and J.-J. L\u00e9vy. Two generalizations of the recursive path ordering, 1980. Unpublished note."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1774732.1774738"},{"key":"e_1_3_2_1_17_1","series-title":"LNAI","first-page":"47","volume-title":"Proc. CADE '03","author":"Korovin K.","year":"2003","unstructured":"K. Korovin and A. Voronkov . An AC-compatible Knuth-Bendix order . In Proc. CADE '03 , volume 2741 of LNAI , pages 47 -- 59 , 2003 . K. Korovin and A. Voronkov. An AC-compatible Knuth-Bendix order. In Proc. CADE '03, volume 2741 of LNAI, pages 47--59, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00021-X"},{"key":"e_1_3_2_1_19_1","series-title":"LNAI","first-page":"384","volume-title":"Proc. CADE '11","author":"Kov\u00e1cs L.","year":"2011","unstructured":"L. Kov\u00e1cs , G. Moser , and A. Voronkov . On transfinite Knuth-Bendix orders . In Proc. CADE '11 , volume 6803 of LNAI , pages 384 -- 399 , 2011 . L. Kov\u00e1cs, G. Moser, and A. Voronkov. On transfinite Knuth-Bendix orders. In Proc. CADE '11, volume 6803 of LNAI, pages 384--399, 2011."},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"47","volume-title":"Proc. PPDP '99","author":"Kusakari K.","year":"1999","unstructured":"K. Kusakari , M. Nakamura , and Y. Toyama . Argument filtering transformation . In Proc. PPDP '99 , volume 1702 of LNCS , pages 47 -- 61 , 1999 . K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. PPDP '99, volume 1702 of LNCS, pages 47--61, 1999."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567078"},{"key":"e_1_3_2_1_23_1","series-title":"LNAI","first-page":"348","volume-title":"Proc. LPAR '07","author":"Ludwig M.","year":"2007","unstructured":"M. Ludwig and U. Waldmann . An extension of the Knuth-Bendix ordering with LPO-like properties . In Proc. LPAR '07 , volume 4790 of LNAI , pages 348 -- 362 , 2007 . M. Ludwig and U. Waldmann. An extension of the Knuth-Bendix ordering with LPO-like properties. In Proc. LPAR '07, volume 4790 of LNAI, pages 348--362, 2007."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00172-7"},{"key":"e_1_3_2_1_25_1","series-title":"LNCS","first-page":"434","volume-title":"RTA '89","author":"Steinbach J.","year":"1989","unstructured":"J. Steinbach . Extensions and comparison of simplification orders. In Proc . RTA '89 , volume 355 of LNCS , pages 434 -- 448 , 1989 . J. Steinbach. Extensions and comparison of simplification orders. In Proc. RTA '89, volume 355 of LNCS, pages 434--448, 1989."},{"key":"e_1_3_2_1_26_1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"TeReSe. Term Rewriting Systems , volume 55 of Cambridge Tracts in Theoretical Computer Science . Cambridge University Press , 2003 . TeReSe. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_27_1","unstructured":"TPDB. The termination problem data base. http:\/\/termination-portal.org\/wiki\/TPDB.  TPDB. The termination problem data base. http:\/\/termination-portal.org\/wiki\/TPDB."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28717-6_33"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_50"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9131-z"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1003"},{"key":"e_1_3_2_1_32_1","first-page":"3","article-title":"The termination hierarchy for term rewriting. Applicable Algebra in Engineering","volume":"12","author":"Zantema H.","year":"2001","unstructured":"H. Zantema . The termination hierarchy for term rewriting. Applicable Algebra in Engineering , Communication and Computing , 12 : 3 -- 19 , 2001 . H. Zantema. The termination hierarchy for term rewriting. Applicable Algebra in Engineering, Communication and Computing, 12:3--19, 2001.","journal-title":"Communication and Computing"}],"event":{"name":"PPDP '13: 15th International Symposium on Principles and Practice of Declarative Programming","sponsor":["Universidad Complutense de Madrid","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Madrid Spain","acronym":"PPDP '13"},"container-title":["Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505879.2505885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:16Z","timestamp":1750232056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":31,"alternative-id":["10.1145\/2505879.2505885","10.1145\/2505879"],"URL":"https:\/\/doi.org\/10.1145\/2505879.2505885","relation":{},"subject":[],"published":{"date-parts":[[2013,9,16]]},"assertion":[{"value":"2013-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}