{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:59:09Z","timestamp":1772197149714,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000143","name":"National Science Foundation Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-2525738"],"award-info":[{"award-number":["CCF-2525738"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006502","name":"Defense Advanced Research Projects Agency Defense Sciences Office","doi-asserted-by":"publisher","award":["HR001123S0001-FP-004"],"award-info":[{"award-number":["HR001123S0001-FP-004"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115762","type":"journal-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T07:38:18Z","timestamp":1769672298000},"page":"115762","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1684-1077","authenticated-orcid":false,"given":"Piotr","family":"Wojciechowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115762_bib0001","series-title":"WALCOM: Algorithms and Computation \u2013 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28\u2013March 2, 2025, Proceedings","first-page":"377","article-title":"Dag-like unit refutations in UTVPI constraint systems","volume":"15411","author":"Wojciechowski","year":"2025"},{"key":"10.1016\/j.tcs.2026.115762_bib0002","series-title":"Logics in Artificial Intelligence - 19th European Conference, JELIA 2025, Kutaisi, Georgia, September 1\u20134, 2025, Proceedings, Part I","first-page":"154","article-title":"Finding short tree-like unit refutations in UTVPI constraint systems","volume":"16093","author":"Wojciechowski","year":"2025"},{"key":"10.1016\/j.tcs.2026.115762_bib0003","series-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","first-page":"238","author":"Cousot","year":"1977"},{"key":"10.1016\/j.tcs.2026.115762_bib0004","series-title":"Proceedings of the 5th International Workshop on the Frontiers of Combining Systems","first-page":"168","article-title":"An efficient decision procedure for UTVPI constraints","author":"Lahiri","year":"2005"},{"key":"10.1016\/j.tcs.2026.115762_bib0005","doi-asserted-by":"crossref","unstructured":"A. Min\u00e9, The octagon abstract domain, Higher-Order and Symbolic Computation, 19 (1), 2006.","DOI":"10.1007\/s10990-006-8609-1"},{"key":"10.1016\/j.tcs.2026.115762_bib0006","series-title":"On the complexity of selected satisfiability and equivalence queries over boolean formulas and inclusion queries over hulls","first-page":"1","author":"Subramani","year":"2009"},{"key":"10.1016\/j.tcs.2026.115762_bib0007","doi-asserted-by":"crossref","unstructured":"J. Jaffar, M.J. Maher, P.J. Stuckey, H.C. Yap, Beyond Finite Domains, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, 1994.","DOI":"10.1007\/3-540-58601-6_92"},{"issue":"2","key":"10.1016\/j.tcs.2026.115762_bib0008","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","article-title":"Certifying algorithms","volume":"5","author":"Mcconnell","year":"2011","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.tcs.2026.115762_bib0009","series-title":"ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30\u2013October 4, 2023, Krak\u00d3W, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023)","first-page":"2226","article-title":"Unit refutations of difference constraint systems","volume":"372","author":"Subramani","year":"2023"},{"key":"10.1016\/j.tcs.2026.115762_bib0010","series-title":"Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1\u20135, 2021, Proceedings","first-page":"226","article-title":"Tree-like unit refutations in horn constraint systems","volume":"12638","author":"Subramani","year":"2021"},{"issue":"1","key":"10.1016\/j.tcs.2026.115762_bib0011","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s00453-016-0131-1","article-title":"A combinatorial certifying algorithm for linear feasibility in UTVPI constraints","volume":"78","author":"Subramani","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115762_bib0012","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.dam.2020.10.016","article-title":"Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints","volume":"305","author":"Wojciechowski","year":"2021","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2026.115762_bib0013","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00224-005-1140-7","article-title":"Approximating MIN 2-SAT and MIN 3-SAT","volume":"38","author":"Avidor","year":"2005","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115762_bib0014","first-page":"415","article-title":"On the existence of fast approximation schemes, Nonlinear Programming, Nonlinear Programming","author":"Korte","year":"1981"},{"key":"10.1016\/j.tcs.2026.115762_bib0015","unstructured":"SRI International, Yices: An SMT solver, http:\/\/yices.csl.sri.com\/."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:02Z","timestamp":1772193902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":15,"alternative-id":["S0304397526000216"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115762","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115762","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115762"}}