{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:52:29Z","timestamp":1782481949984,"version":"3.54.5"},"reference-count":65,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003081","name":"Ministry of Education, Ethiopia","doi-asserted-by":"publisher","award":["RG102\/23"],"award-info":[{"award-number":["RG102\/23"]}],"id":[{"id":"10.13039\/501100003081","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["226-2024-00140"],"award-info":[{"award-number":["226-2024-00140"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572427"],"award-info":[{"award-number":["62572427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62502475"],"award-info":[{"award-number":["62502475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["W2511064"],"award-info":[{"award-number":["W2511064"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62192732"],"award-info":[{"award-number":["62192732"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000148","name":"Canadian Anesthesiologists' Society","doi-asserted-by":"publisher","award":["YSBR-040"],"award-info":[{"award-number":["YSBR-040"]}],"id":[{"id":"10.13039\/501100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Zhejiang Province Natural Science Foundation","doi-asserted-by":"publisher","award":["LD24F020013"],"award-info":[{"award-number":["LD24F020013"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ic.2026.105487","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:17:34Z","timestamp":1780676254000},"page":"105487","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On termination of polynomial programs with equality conditions"],"prefix":"10.1016","volume":"312","author":[{"given":"Yangjia","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9663-7441","authenticated-orcid":false,"given":"Mingshuai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liangran","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-3817","authenticated-orcid":false,"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ic.2026.105487_bib0001","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1090\/S0002-9939-1971-0280473-X","article-title":"On the length of a Hilbert ascending chain","volume":"29","author":"Seidenberg","year":"1971","journal-title":"Proc. Amer. Math. Soc."},{"issue":"5","key":"10.1016\/j.ic.2026.105487_bib0002","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/1941487.1941509","article-title":"Proving program termination","volume":"54","author":"Cook","year":"2011","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/j.ic.2026.105487_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11704-009-0074-7","article-title":"Recent advances in program verification through computer algebra","volume":"4","author":"Yang","year":"2010","journal-title":"Front. Comput. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105487_bib0004","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"43","author":"Turing","year":"1937","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/j.ic.2026.105487_bib0005","series-title":"CAV\u201904","first-page":"70","article-title":"Termination of linear programs","volume":"3114","author":"Tiwari","year":"2004"},{"key":"10.1016\/j.ic.2026.105487_bib0006","series-title":"ICALP\u201904","first-page":"1016","article-title":"A note on Karr\u2019s algorithm","volume":"3142","author":"M\u00fcller-Olm","year":"2004"},{"key":"10.1016\/j.ic.2026.105487_bib0007","series-title":"VMCAI\u201905","first-page":"113","article-title":"Termination of polynomial programs","volume":"3385","author":"Bradley","year":"2005"},{"key":"10.1016\/j.ic.2026.105487_bib0008","series-title":"CAV\u201906","first-page":"372","article-title":"Termination of integer linear programs","volume":"4144","author":"Braverman","year":"2006"},{"issue":"4","key":"10.1016\/j.ic.2026.105487_bib0009","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/2629488","article-title":"Ranking functions for linear-constraint loops","volume":"61","author":"Ben-Amram","year":"2014","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2026.105487_bib0010","series-title":"TACAS\u201901","first-page":"67","article-title":"Synthesis of linear ranking functions","volume":"2031","author":"Col\u00f3n","year":"2001"},{"key":"10.1016\/j.ic.2026.105487_bib0011","series-title":"VMCAI\u201904","first-page":"239","article-title":"A complete method for the synthesis of linear ranking functions","volume":"2937","author":"Podelski","year":"2004"},{"key":"10.1016\/j.ic.2026.105487_bib0012","series-title":"LICS\u201904","first-page":"32","article-title":"Transition invariants","author":"Podelski","year":"2004"},{"key":"10.1016\/j.ic.2026.105487_bib0013","series-title":"ICTAC\u201907","first-page":"34","article-title":"Discovering non-linear ranking functions by solving semi-algebraic systems","volume":"4711","author":"Chen","year":"2007"},{"key":"10.1016\/j.ic.2026.105487_bib0014","series-title":"VMCAI\u201905","first-page":"1","article-title":"Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming","volume":"3385","author":"Cousot","year":"2005"},{"key":"10.1016\/j.ic.2026.105487_bib0015","series-title":"POPL\u201908","first-page":"147","article-title":"Proving non-termination","author":"Gupta","year":"2008"},{"key":"10.1016\/j.ic.2026.105487_bib0016","series-title":"SAS\u201910","first-page":"304","article-title":"Alternation for termination","volume":"6337","author":"Harris","year":"2010"},{"key":"10.1016\/j.ic.2026.105487_bib0017","series-title":"SODA\u201915","first-page":"957","article-title":"On termination of integer linear loops","author":"Ouaknine","year":"2015"},{"issue":"3","key":"10.1016\/j.ic.2026.105487_bib0018","first-page":"1","article-title":"Deciding conditional termination","volume":"10","author":"Bozga","year":"2014","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2026.105487_bib0019","series-title":"CAV\u201919","first-page":"426","article-title":"Termination of triangular integer loops is decidable","volume":"11562","author":"Frohn","year":"2019"},{"key":"10.1016\/j.ic.2026.105487_bib0020","series-title":"SCSS\u201913","first-page":"81","article-title":"Generating asymptotically non-terminant initial variable values for linear diagonalizable programs","author":"Rebiha","year":"2013"},{"issue":"2","key":"10.1016\/j.ic.2026.105487_bib0021","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00165-009-0144-5","article-title":"Symbolic decision procedure for termination of linear programs","volume":"23","author":"Xia","year":"2011","journal-title":"Form. Asp. Comput."},{"issue":"11","key":"10.1016\/j.ic.2026.105487_bib0022","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1016\/j.jsc.2010.06.006","article-title":"Termination of linear programs with nonlinear constraints","volume":"45","author":"Xia","year":"2010","journal-title":"J. Symb. Comput."},{"issue":"3","key":"10.1016\/j.ic.2026.105487_bib0023","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00165-012-0252-5","article-title":"Proving termination of nonlinear command sequences","volume":"25","author":"Babi\u0107","year":"2013","journal-title":"Form. Asp. Comp."},{"issue":"6","key":"10.1016\/j.ic.2026.105487_bib0024","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1007\/s11424-014-2145-6","article-title":"Discovering non-terminating inputs for multi-path polynomial programs","volume":"27","author":"Liu","year":"2014","journal-title":"J. Sys. Sci. Compl."},{"issue":"2","key":"10.1016\/j.ic.2026.105487_bib0025","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2766189.2766191","article-title":"On linear recurrence sequences and loop termination","volume":"2","author":"Ouaknine","year":"2015","journal-title":"ACM SIGLOG News"},{"key":"10.1016\/j.ic.2026.105487_bib0026","article-title":"Introduction to Commutative Algebra","author":"Atiyah","year":"1969"},{"key":"10.1016\/j.ic.2026.105487_bib0027","first-page":"305","article-title":"Constructive proof of Hilbert\u2019s theorem on ascending chains","volume":"174","author":"Seidenberg","year":"1972","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ic.2026.105487_bib0028","series-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einum nulldimensionalen Polynomideal","author":"Buchberger","year":"1965"},{"key":"10.1016\/j.ic.2026.105487_bib0029","series-title":"STACS\u201989","first-page":"400","article-title":"Membership in polynomial ideals over Q is exponential space complete","volume":"349","author":"Mayr","year":"1989"},{"key":"10.1016\/j.ic.2026.105487_bib0030","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1006\/jcom.1997.0447","article-title":"Some complexity results for polynomial ideals","volume":"13","author":"Mayr","year":"1997","journal-title":"J. Complex."},{"key":"10.1016\/j.ic.2026.105487_bib0031","series-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski","year":"1951"},{"key":"10.1016\/j.ic.2026.105487_bib0032","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1112\/plms\/s2-26.1.531","article-title":"Some properties of enumeration in the theory of modular systems","volume":"s2-26","author":"Macaulay","year":"1926","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/j.ic.2026.105487_bib0033","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-12421","article-title":"Length of polynomial ascending chains and primitive recursiveness","volume":"71","author":"Moreno-Soc\u00edas","year":"1992","journal-title":"Math. Scand."},{"key":"10.1016\/j.ic.2026.105487_bib0034","series-title":"LICS\u201911","first-page":"269","article-title":"Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma","author":"Figueira","year":"2011"},{"issue":"1","key":"10.1016\/j.ic.2026.105487_bib0035","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00236-013-0185-3","article-title":"Termination of nondeterministic quantum programs","volume":"51","author":"Li","year":"2014","journal-title":"Acta Inf."},{"issue":"2\u20133","key":"10.1016\/j.ic.2026.105487_bib0036","first-page":"121","article-title":"\u00dcber eine Schlussweise aus dem Endlichen ins Unendliche","volume":"3","author":"K\u00f6nig","year":"1927","journal-title":"Acta Sci. Math."},{"issue":"3","key":"10.1016\/j.ic.2026.105487_bib0037","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/00029890.1973.11993265","article-title":"Hilbert\u2019s tenth problem is unsolvable","volume":"80","author":"Davis","year":"1973","journal-title":"Am. Math. Mon."},{"issue":"8","key":"10.1016\/j.ic.2026.105487_bib0038","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/j.ic.2026.105487_bib0039","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jsc.2007.01.002","article-title":"Generating all polynomial invariants in simple loops","volume":"42","author":"Rodr\u00edguez-Carbonell","year":"2007","journal-title":"J. Symb. Comp."},{"issue":"5","key":"10.1016\/j.ic.2026.105487_bib0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3614319","article-title":"On strongest algebraic program invariants","volume":"70","author":"Hrushovski","year":"2023","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.ic.2026.105487_bib0041","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.scico.2006.03.003","article-title":"Automatic generation of polynomial invariants of bounded degree using abstract interpretation","volume":"64","author":"Rodr\u00edguez-Carbonell","year":"2007","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.ic.2026.105487_bib0042","series-title":"Proceedings of the 11th International Static Analysis Symposium","first-page":"296","article-title":"Approximating the algebraic relational semantics of imperative programs","volume":"3148","author":"Col\u00f3n","year":"2004"},{"key":"10.1016\/j.ic.2026.105487_bib0043","series-title":"POPL\u201977","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/j.ic.2026.105487_bib0044","series-title":"RAMiCS\u201923","first-page":"176","article-title":"What else is undecidable about loops?","volume":"13896","author":"Kov\u00e1cs","year":"2023"},{"issue":"5\u20136","key":"10.1016\/j.ic.2026.105487_bib0045","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s00165-015-0333-3","article-title":"Generating invariants for non-linear loops by linear algebraic methods","volume":"27","author":"Rebiha","year":"2015","journal-title":"Formal Asp. Comput."},{"issue":"1","key":"10.1016\/j.ic.2026.105487_bib0046","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0362-546X(76)90008-0","article-title":"On discrete-time polynomial systems","volume":"1","author":"Sontag","year":"1976","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"10.1016\/j.ic.2026.105487_bib0047","series-title":"EMSOFT\u201911","first-page":"97","article-title":"Computing semi-algebraic invariants for polynomial dynamical systems","author":"Liu","year":"2011"},{"key":"10.1016\/j.ic.2026.105487_bib0048","series-title":"POPL\u201904","first-page":"318","article-title":"Non-linear loop invariant generation using Gr\u00f6bner bases","author":"Sankaranarayanan","year":"2004"},{"issue":"5","key":"10.1016\/j.ic.2026.105487_bib0049","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ipl.2004.05.004","article-title":"Computing polynomial program invariants","volume":"91","author":"M\u00fcller-Olm","year":"2004","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"10.1016\/j.ic.2026.105487_bib0050","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s11424-006-0307-x","article-title":"A quantifier-elimination based heuristic for automatically generating inductive assertions for programs","volume":"19","author":"Kapur","year":"2006","journal-title":"J. Sys. Sci. Compl."},{"key":"10.1016\/j.ic.2026.105487_bib0051","series-title":"TACAS\u201908","first-page":"249","article-title":"Reasoning algebraically about P-solvable loops","volume":"4963","author":"Kov\u00e1cs","year":"2008"},{"key":"10.1016\/j.ic.2026.105487_bib0052","series-title":"ICTAC\u201916","first-page":"33","article-title":"Termination of single-path polynomial loop programs","volume":"9965","author":"Li","year":"2016"},{"key":"10.1016\/j.ic.2026.105487_bib0053","series-title":"PLDI\u201906","first-page":"415","article-title":"Termination proofs for systems code","author":"Cook","year":"2006"},{"key":"10.1016\/j.ic.2026.105487_bib0054","series-title":"POPL\u201912","first-page":"245","article-title":"An abstract interpretation framework for termination","author":"Cousot","year":"2012"},{"key":"10.1016\/j.ic.2026.105487_bib0055","series-title":"CAV\u201908","first-page":"328","article-title":"Proving conditional termination","volume":"5123","author":"Cook","year":"2008"},{"key":"10.1016\/j.ic.2026.105487_bib0056","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3708559","article-title":"Synthesizing invariants for polynomial programs by semidefinite programming","volume":"47","author":"Wu","year":"2024","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.ic.2026.105487_bib0057","series-title":"46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)","first-page":"118:1","article-title":"Termination of linear loops over the integers","volume":"132","author":"Hosseini","year":"2019"},{"key":"10.1016\/j.ic.2026.105487_bib0058","first-page":"1","article-title":"On the decidability of termination for polynomial loops","volume":"abs\/1910.11588","author":"Frohn","year":"2019","journal-title":"CoRR"},{"key":"10.1016\/j.ic.2026.105487_bib0059","series-title":"LPAR\u201920","first-page":"279","article-title":"Polynomial loops: beyond termination","volume":"73","author":"Hark","year":"2020"},{"key":"10.1016\/j.ic.2026.105487_bib0060","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","article-title":"Petri nets and large finite sets","volume":"32","author":"McAloon","year":"1984","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10.1016\/j.ic.2026.105487_bib0061","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1016\/j.apal.2016.06.001","article-title":"Reverse mathematical bounds for the termination theorem","volume":"167","author":"Steila","year":"2016","journal-title":"Ann. Pure Appl. Logic"},{"issue":"6","key":"10.1016\/j.ic.2026.105487_bib0062","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.3906\/mat-1904-61","article-title":"Ascending chains of ideals in the polynomial ring","volume":"44","author":"PASTUSZAK","year":"2020","journal-title":"Turk. J. Math."},{"key":"10.1016\/j.ic.2026.105487_bib0063","series-title":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","first-page":"1-12","article-title":"Polynomial automata: zeroness and applications","author":"Benedikt","year":"2017"},{"key":"10.1016\/j.ic.2026.105487_bib0064","series-title":"International Conference on Computer Aided Verification","first-page":"431","article-title":"Breaking the mold: nonlinear ranking function synthesis without templates","author":"Zhu","year":"2024"},{"key":"10.1016\/j.ic.2026.105487_bib0065","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1155\/S1073792894000127","article-title":"Rational periodic points of rational functions","volume":"2","author":"Morton","year":"1994","journal-title":"Inter. Math. Res. Notices"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:39:12Z","timestamp":1782481152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":65,"alternative-id":["S0890540126000842"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105487","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On termination of polynomial programs with equality conditions","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105487","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":"105487"}}