{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T20:04:46Z","timestamp":1780430686889,"version":"3.54.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jlamp.2026.101126","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T17:20:55Z","timestamp":1774286455000},"page":"101126","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Inferring RPO symbol orderings"],"prefix":"10.1016","volume":"150","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9149-6229","authenticated-orcid":false,"given":"Wei","family":"Du","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4521-5892","authenticated-orcid":false,"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8249-1867","authenticated-orcid":false,"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1\/2","key":"10.1016\/j.jlamp.2026.101126_bib0001","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jlamp.2026.101126_bib0002","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/j.jlamp.2026.101126_bib0003","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":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2026.101126_bib0004","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\/j.jlamp.2026.101126_bib0005","series-title":"Frontiers of Combining Systems - 14th International Symposium, FroCoS 2023, Prague, Czech Republic, September 20\u201322, 2023, Proceedings","first-page":"81","article-title":"KBO constraint solving revisited","volume":"14279","author":"Briefs","year":"2023"},{"key":"10.1016\/j.jlamp.2026.101126_bib0006","series-title":"Unpublished manuscript","article-title":"Two Generalizations of the Recursive Path Ordering","author":"Kamin","year":"1980"},{"key":"10.1016\/j.jlamp.2026.101126_bib0007","series-title":"Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, Garmisch-Partenkirchen, FRG, 1\u20134 June, 1982","first-page":"331","article-title":"Recursive decomposition ordering","author":"Jouannaud","year":"1982"},{"key":"10.1016\/j.jlamp.2026.101126_bib0008","first-page":"173","article-title":"A path ordering for proving termination of term rewriting systems","volume":"185","author":"Kapur","year":"1985"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101126_bib0009","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00302640","article-title":"On the recursive decomposition ordering with lexicographical status and other related orderings","volume":"6","author":"Lescanne","year":"1990","journal-title":"J. Autom. Reason."},{"key":"10.1016\/j.jlamp.2026.101126_bib0010","series-title":"6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, Buenos Aires, Argentina (Virtual Conference), July 17\u201324, 2021","first-page":"19:1","article-title":"An RPO-based ordering modulo permutation equations and its applications to rewrite systems","volume":"195","author":"Kim","year":"2021"},{"key":"10.1016\/j.jlamp.2026.101126_bib0011","series-title":"Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12\u201314, 2006, Proceedings","first-page":"4","article-title":"Solving partial order constraints for LPO termination","volume":"4098","author":"Codish","year":"2006"},{"issue":"2","key":"10.1016\/j.jlamp.2026.101126_bib0012","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10817-009-9131-z","article-title":"KBO orientability","volume":"43","author":"Zankl","year":"2009","journal-title":"J. Autom. Reason."},{"key":"10.1016\/j.jlamp.2026.101126_bib0013","series-title":"Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10\u201312, 2007, Proceedings","first-page":"267","article-title":"Proving termination using recursive path orders and SAT solving","volume":"4720","author":"Schneider-Kamp","year":"2007"},{"key":"10.1016\/j.jlamp.2026.101126_bib0014","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(85)90175-6","article-title":"On recursive path ordering","volume":"40","author":"Krishnamoorthy","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2026.101126_bib0015","series-title":"Proceedings 17th International Workshop on Logical and Semantic Frameworks with Applications, LSFA 2022, Belo Horizonte, Brazil (Hybrid), 23\u201324 September 2022","first-page":"49","article-title":"Equational theorem proving for clauses over strings","volume":"376","author":"Kim","year":"2022"},{"key":"10.1016\/j.jlamp.2026.101126_bib0016","series-title":"Computational Logic - CL 2000, First International Conference, London, UK, 24\u201328 July, 2000, Proceedings","first-page":"660","article-title":"The theory of total unary RPO is decidable","volume":"1861","author":"Narendran","year":"2000"},{"key":"10.1016\/j.jlamp.2026.101126_bib0017","article-title":"Propositional Logic: Deduction and Algorithms","volume":"48","author":"KleineB\u00fcning","year":"1999"},{"key":"10.1016\/j.jlamp.2026.101126_bib0018","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.jlamp.2026.101126_bib0019","series-title":"Technical Memorandum","article-title":"Knuth-Bendix algorithm for Thue system based on Kachinuki ordering","author":"Sakai","year":"1984"},{"key":"10.1016\/j.jlamp.2026.101126_bib0020","series-title":"SEKI Report","article-title":"Comparing on Strings: Iterated Syllable Ordering & Recursive path Ordering","author":"Steinbach","year":"1989"},{"key":"10.1016\/j.jlamp.2026.101126_bib0021","series-title":"23rd International Conference on Rewriting Techniques and Applications, RTA 2012, Nagoya, Japan, May 28\u2013June 2, 2012","first-page":"339","article-title":"On the formalization of termination techniques based on multiset orderings","volume":"15","author":"Thiemann","year":"2012"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T19:24:19Z","timestamp":1780428259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220826000180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":21,"alternative-id":["S2352220826000180"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101126","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inferring RPO symbol orderings","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101126","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"101126"}}