{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:53Z","timestamp":1761620873553},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7868,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0747-7171(92)90002-l","type":"journal-article","created":{"date-parts":[[2004,12,9]],"date-time":"2004-12-09T22:58:50Z","timestamp":1102633130000},"page":"1-24","source":"Crossref","is-referenced-by-count":39,"title":["A canonical form for generalized linear constraints"],"prefix":"10.1016","volume":"13","author":[{"given":"Jean-Louis","family":"Lassez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"McAloon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0747-7171(92)90002-L_BIB1","series-title":"Equivalent Linear Programs","author":"Adler","year":"1976"},{"key":"10.1016\/0747-7171(92)90002-L_BIB2","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/357146.357147","article-title":"The programming language aspects of THINGLAB-a constraint oriented simulation laboratory","volume":"3","author":"Borning","year":"1981","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0747-7171(92)90002-L_BIB3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/mnsc.17.5.354","article-title":"Equivalent integer programs and canonical problems","volume":"17","author":"Bradley","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/0747-7171(92)90002-L_BIB4","series-title":"Advance Papers 4th Int. Joint Conference on Artificial Intelligence","first-page":"15","article-title":"A new method for proving certain Presburger formulas","author":"Bledsoe","year":"1975"},{"key":"10.1016\/0747-7171(92)90002-L_BIB5","first-page":"281","article-title":"Constraint propagation with integral labels","volume":"32","author":"Davis","year":"1987","journal-title":"AI Journal"},{"key":"10.1016\/0747-7171(92)90002-L_BIB6","first-page":"1","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"AI Journal"},{"key":"10.1016\/0747-7171(92)90002-L_NEWBIB31","unstructured":"Dickman, M. A. Model Theory and Real Algebraic Geometry. North Holland (to appear)."},{"key":"10.1016\/0747-7171(92)90002-L_BIB7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0020-0190(79)90152-2","article-title":"Linear programming is log-space hard for P","volume":"8","author":"Dobkin","year":"1979","journal-title":"Information Processing Letters"},{"key":"10.1016\/0747-7171(92)90002-L_BIB8_1","first-page":"xlvii, 1v","article-title":"An Analyse des travaux de l'Acadimie Royale des Sciences, pendant 1'annee 1824, Partae mathbmatique","volume":"7","author":"Fourier","year":"1827","journal-title":"Histoire de l'Acadimie Royale des Sciences de 1'Institut de France"},{"key":"10.1016\/0747-7171(92)90002-L_BIB8_2","first-page":"38","article-title":"Translation of a Report by Fourier on his work on Linear Inequalities","volume":"10","author":"Kohler","year":"1973","journal-title":"Opsearch"},{"key":"10.1016\/0747-7171(92)90002-L_BIB9","series-title":"Linear Algebra","author":"Fiedber","year":"1979"},{"key":"10.1016\/0747-7171(92)90002-L_BIB10","series-title":"Constraint-Directed Search: A Case Study of Job-Shop Scheduling","author":"Fox","year":"1987"},{"key":"10.1016\/0747-7171(92)90002-L_BIB11","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0747-7171(92)90002-L_BIB12","series-title":"Proceedings of POPL","article-title":"Constraint logic programming","author":"Jaflar","year":"1987"},{"key":"10.1016\/0747-7171(92)90002-L_BIB13","series-title":"Proceedings of the 1987 Logic Programming Conference","article-title":"Methodology and implementation of a CLP system","author":"Jafar","year":"1987"},{"key":"10.1016\/0747-7171(92)90002-L_BIB14","first-page":"141","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmakar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0747-7171(92)90002-L_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45535-3","article-title":"Redundancy in Mathematical Programming, A State-of-theArt Survey","volume":"206","author":"Karwan","year":"1983","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"key":"10.1016\/0747-7171(92)90002-L_BIB16_1","first-page":"1093","article-title":"Polynomial algorithms in linear programming","volume":"244","author":"Khachiyan","year":"1979","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"10.1016\/0747-7171(92)90002-L_BIB16_2","first-page":"191","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/0747-7171(92)90002-L_BIB17","series-title":"Proceedings of NACLP 89","article-title":"Simplification and elimination of redundant arithmetic constraints","author":"Lassez","year":"1989"},{"key":"10.1016\/0747-7171(92)90002-L_BIB18","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Unification revisited","author":"Lassez","year":"1988"},{"key":"10.1016\/0747-7171(92)90002-L_BIB19","series-title":"Proceedings of the 1988 FGCS Conference","first-page":"703","article-title":"Applications of a canonical form for generalized linear constraints","author":"Lassez","year":"1988"},{"key":"10.1016\/0747-7171(92)90002-L_BIB20","series-title":"TAPSOFT 89, Advanced Seminar on Foundations of Innovative Software Development","first-page":"19","article-title":"Independence of negative constraints","volume":"351","author":"Lassez","year":"1989"},{"key":"10.1016\/0747-7171(92)90002-L_BIB21","first-page":"52","article-title":"A constraint sequent calculus","author":"Lassez","year":"1990","journal-title":"LICS"},{"key":"10.1016\/0747-7171(92)90002-L_BIB22","series-title":"Proceedings of ICLP4","article-title":"A logic semantics for a class of committed choice languages","author":"Maher","year":"1987"},{"key":"10.1016\/0747-7171(92)90002-L_BIB23","author":"Nelson","year":"1982"},{"key":"10.1016\/0747-7171(92)90002-L_BIB24","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/0747-7171(92)90002-L_BIB25","article-title":"Concurrent constraint logic programming","author":"Saraswat","year":"1989"},{"key":"10.1016\/0747-7171(92)90002-L_BIB26","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0747-7171(92)90002-L_BIB27","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/322033.322034","article-title":"On the SUP-INF method for proving Presburger formulas","volume":"24","author":"Shostak","year":"1977","journal-title":"JACM"},{"key":"10.1016\/0747-7171(92)90002-L_BIB28","article-title":"CONSTRAINTS-a Constraint Based Programming Language","author":"Steele","year":"1982","journal-title":"AI Journal"},{"key":"10.1016\/0747-7171(92)90002-L_NEWBIB32","unstructured":"Ueda, K. Guarded Horn Clauses. MIT Press (to appear)."},{"key":"10.1016\/0747-7171(92)90002-L_BIB29","series-title":"Constraint Satisfaction in Logic Programming","author":"van Hentenryck","year":"1989"},{"key":"10.1016\/0747-7171(92)90002-L_BIB30","first-page":"1","article-title":"Special issue on Algorithms in Real Algebraic Geometry","volume":"5","author":"Weispfenning","year":"1988","journal-title":"J. Symbolic Computation"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290002L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290002L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:26:54Z","timestamp":1548980814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074771719290002L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["074771719290002L"],"URL":"https:\/\/doi.org\/10.1016\/0747-7171(92)90002-l","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}