{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T00:35:04Z","timestamp":1775090104800,"version":"3.50.1"},"reference-count":346,"publisher":"Elsevier","isbn-type":[{"value":"9780444508133","type":"print"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1016\/b978-044450813-3\/50014-x","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T13:04:11Z","timestamp":1181567051000},"page":"751-842","source":"Crossref","is-referenced-by-count":34,"title":["Solving Numerical Constraints"],"prefix":"10.1016","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[]},{"given":"Volker","family":"Weispfenning","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Maher","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-044450813-3\/50014-X_bb0010","series-title":"Integer Programming and Combinatorial Optimization, IPCO'98","first-page":"229","article-title":"Solving a linear diophantine equation with lower and upper bounds on the variables","author":"Aardal","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0015","article-title":"Solving a system of diophantine equations with lower and upper bounds on the variables","author":"Aardal","year":"1998","journal-title":"Technical Report UU-CS-1998-36, Department of Computer Science, Utrecht University"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0020","article-title":"Non-standard approaches to integer programming","author":"Aardal","year":"1999","journal-title":"Technical Report UU-CS-1999-41, Department of Computer Science, Utrecht University"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0025","series-title":"Rewriting Techniques and Applications, RTA'95, Kaiserslautern","first-page":"339","article-title":"General solution of systems of linear diophantine equations and inequations","author":"Abdulrab","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0030","series-title":"Rewriting Techniques and Applications, RTA'89, Chapel Hill","first-page":"530","article-title":"Solving systems of linear diophantine equations and word equations","author":"Abdulrab","year":"1989"},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb0035","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0747-7171(92)90025-Y","article-title":"AC-Unification Race: The System Solving Approach, Implementation and Benchmarks","volume":"14","author":"Adi","year":"1992","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0040","series-title":"Etude de la r\u00e9solution de contraintes diophantiennes lin\u00e9aires sur les entiers naturels","author":"Ajili","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0045","article-title":"Contraintes diophantiennes lin\u00e9aires: r\u00e9solution et coop\u00e9ration inter-r\u00e9solveurs","author":"Ajili","year":"1998","journal-title":"PhD thesis, Univ. Henri Poincar\u00e9, Nancy, France"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0050","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(96)00195-8","article-title":"Avoiding slack variables in the solving of linear diophantine equations and inequations","volume":"173","author":"Ajili","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0055","series-title":"Principles of Declarative Programming, ALP\/PLILP'98, Pisa","first-page":"463","article-title":"Integrating constraint propagation in complete solving of linear diophantine systems","author":"Ajili","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0060","series-title":"30th ACM Symposium on the Theory of Computing, STOC'98, Dallas","first-page":"10","article-title":"The shortest vector problem in l2 is NP-hard for randomized reduction","author":"Ajtai","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0065","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC 2000","first-page":"14","article-title":"Deciding linear-trigonometric problems","author":"Anai","year":"2000"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0070","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jsco.1995.1026","article-title":"A Gr\u00f6bner approach to involutive bases","volume":"19","author":"Apel","year":"1995","journal-title":"J. Symb. Comp."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0075","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1006\/jsco.1997.0194","article-title":"The theory of involutive divisions and an application to Hilbert function computations","volume":"25","author":"Apel","year":"1998","journal-title":"J. Symb. Comp."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0080","series-title":"Artificial Intelligence: Methodology, Systems, Applications, AIMSA'98","first-page":"28","article-title":"Constraint solving in logic programming and in automated deduction: a comparison","author":"Armando","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0085","series-title":"Artificial Intelligence and Symbolic Computation, AISC'98","first-page":"42","article-title":"From integrated reasoning specialists to \u201cplug-and-play\u201d reasoning components","author":"Armando","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0090","series-title":"Foundations of Computer Science FOCS'93, Palo Alto","article-title":"The hardness of approximate optima in lattices, codes, and systems of linear equations","author":"Arora","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0095","series-title":"Principles and Practice of Constraint Programming, CP'98, Pisa","first-page":"55","article-title":"Optimized Q-pivot for exact linear solvers","author":"Azulay","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0100","first-page":"445","article-title":"Unification theory","volume":"Vol. I","author":"Baader","year":"2001"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0105","first-page":"19","article-title":"Resolution theorem proving","volume":"Vol. I","author":"Bachmair","year":"2001"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0110","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1098\/rsta.1968.0010","article-title":"Contributions to the theory of diophantine equations. I\/II","volume":"263","author":"Baker","year":"1968","journal-title":"Philos. Trans. Roy. Soc. London, Ser. A"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0115","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"issue":"1-3","key":"10.1016\/B978-044450813-3\/50014-X_bb0120","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","article-title":"Disjunctive programming: Properties of the convex hull of feasible points","volume":"89","author":"Balas","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0125","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0-1 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Mathematical Programming"},{"issue":"9","key":"10.1016\/B978-044450813-3\/50014-X_bb0130","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0-1 programming by lift-and-project in a branch-and-cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0135","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(96)00007-7","article-title":"Gomory cuts revisited","volume":"19","author":"Balas","year":"1996","journal-title":"Operations Research Letters"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0140","series-title":"A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming, Management Science Research Report # MSRR-631","author":"Balas","year":"2000"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0145","first-page":"565","article-title":"Sylvester's identity and multistep integer-preserving Gaussian elimination","volume":"22","author":"Bareiss","year":"1968","journal-title":"Mathematics of Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0150","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1315-1","article-title":"Logic-based 0-1 constraint programming","author":"Barth","year":"1996"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0155","series-title":"Logic Programming. 12th International Conference, ICLP'95, Kanagawa, Japan","first-page":"133","article-title":"Finite domain and cutting plane techniques in CLP(PB)","author":"Barth","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0160","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1023\/A:1018981813157","article-title":"Modelling discrete optimisation problems in constraint logic programming","volume":"81","author":"Barth","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0165","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"341","article-title":"A new algorithm to find a point in every cell defined by a family of polynomials","author":"Basu","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_rf0170","series-title":"Recent Advances in Real Algebraic Geometry and Quadratic Forms","first-page":"271","article-title":"On the trace formula for quadratic forms","author":"Becker","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_rf9000","series-title":"Proceedings of the RAGSQUAD Year","year":"1990"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0175","series-title":"Gr\u00f6bner Bases, a Computational Approach to Commutative Algebra","author":"Becker","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0180","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","article-title":"The complexity of elementary algebra and geometry","volume":"32","author":"Ben-Or","year":"1986","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0185","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","article-title":"The complexity of logical theories","volume":"11","author":"Berman","year":"1980","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0190","series-title":"Artificial Intelligence and Symbolic Computation, AISC'98","first-page":"94","article-title":"Specification and integration of theorem provers and computer algebra systems","author":"Bertoli","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0195","series-title":"Introduction to linear optimization","author":"Bertsimas","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0200","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1006\/jnth.1996.0129","article-title":"Solving Thue equations of high degree","volume":"60","author":"Bilu","year":"1996","journal-title":"J. Number Th."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0205","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1000305028888","article-title":"Solving superelliptic diophantine equations by Baker's method","volume":"112","author":"Bilu","year":"1998","journal-title":"Compositio Math."},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0210","doi-asserted-by":"crossref","first-page":"311","DOI":"10.4064\/aa-88-4-311-326","article-title":"Thue equations with composite fields","volume":"88","author":"Bilu","year":"1999","journal-title":"Acta Arithmetica"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0215","series-title":"14th International Conference on Automated Deduction, CADE-14, Townsville","article-title":"A practical integration of first-order reasoning and decision procedures","author":"Bj\u00f8rner","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0220","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00933212","article-title":"A converse for disjunctive constraints","volume":"25","author":"Blair","year":"1978","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0225","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","article-title":"New finite pivoting rules for the simplex method","volume":"2","author":"Bland","year":"1977","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0230","series-title":"Fourth Int. Joint Conf. on Artificial Intelligence, IJCAI'75, Tbilisi","article-title":"A new method for proving certain Presburger formulas","author":"Bledsoe","year":"1975"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0235","series-title":"ACM Symposium on Theory of computing, STOC'99, Atlanta, GA","first-page":"711","article-title":"On the complexity of computing short linearly independent vectors and short bases in a lattice","author":"Bl\u00f6mer","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0240","series-title":"G\u00e9ometrie alg\u00e9brique r\u00e9elle","author":"Bochnak","year":"1987"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0245","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00247435","article-title":"A note on a canonical theory with undecidable unification and matching problem","volume":"3","author":"Bockmayr","year":"1987","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0250","series-title":"Constraint Logic Programming. Selected Research","first-page":"327","article-title":"Logic programming with pseudo-Boolean constraints","author":"Bockmayr","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0255","series-title":"Constraint Programming: Basics and Trends","first-page":"22","article-title":"Solving pseudo-Boolean constraints","author":"Bockmayr","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0260","article-title":"Cutting planes and the elementary closure in fixed dimension, Research Report MPI-I-99-2-008, Max-Planck-Institut f\u00fcr Informatik","author":"Bockmayr","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0265","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","article-title":"On the Chv\u00e1tal rank of polytopes in the 0\/1 cube","volume":"98","author":"Bockmayr","year":"1999","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0270","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","article-title":"Branch-and-infer: A unifying framework for integer and finite domain constraint programming","volume":"10","author":"Bockmayr","year":"1998","journal-title":"INFORMS J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0275","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.7.3.441","article-title":"Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex method","volume":"7","author":"Borgwardt","year":"1982","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0280","series-title":"Trees in Algebra and Programming, CAAP'96, Link\u00f6ping, Sweden","first-page":"30","article-title":"Diophantine equations, Presburger arithmetic and finite automata","author":"Boudet","year":"1996"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0285","series-title":"Machine Intelligence 11: Logic and the acquisition of knowledge","first-page":"83","article-title":"Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic","author":"Boyer","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0290","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'98","first-page":"295","article-title":"Simplification of truth-invariant cylindrical algebraic decomposition","author":"Brown","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0295","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1515\/crll.1999.045","article-title":"A counterexample to an integer analogue of Carath\u00e9odory's theorem","volume":"510","author":"Bruns","year":"1999","journal-title":"J. Reine Angew. Math."},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0300","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(95)00061-5","article-title":"Buchberger's algorithm: the term rewriter's point of view","volume":"159","author":"B\u00fcndgen","year":"1996","journal-title":"Theor. Comp. Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0305","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55034-8","article-title":"A Resolution principle for a logic with restricted quantifiers","author":"B\u00fcrckert","year":"1991"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0310","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00297251","article-title":"Opening the AC-unification race","volume":"4","author":"B\u00fcrckert","year":"1988","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0315","series-title":"Logic Programming. 12th International Conference, ICLP'95, Kanagawa, Japan","first-page":"33","article-title":"Linear equation solving for constraint logic programming","author":"Burg","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0320","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","article-title":"Algebraic Complexity Theory","author":"B\u00fcrgisser","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0325","article-title":"Implementierung eines Algorithmus zur Quantorenelimination f\u00fcr lineare reelle Probleme","author":"Burhenne","year":"1990","journal-title":"Diploma thesis, Universit\u00e4t Passau, D-94030 Passau, Germany"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0330","series-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-93","first-page":"89","article-title":"An efficient algorithm for the sparse resultant","author":"Canny","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0335","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1006\/jsco.1993.1009","article-title":"Multipolynomial resultant algorithms","volume":"15","author":"Canny","year":"1993","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0340","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s101079900107","article-title":"On the separation of maximally violated mod- k cuts","volume":"87","author":"Caprara","year":"2000","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/B978-044450813-3\/50014-X_bb0345","first-page":"1520","article-title":"Contraction of finite systems of linear inequalities","volume":"4","author":"\u010cernikov","year":"1963","journal-title":"Soviet Mathematics Doklady"},{"issue":"5","key":"10.1016\/B978-044450813-3\/50014-X_bb0350","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1093\/comjnl\/36.5.463","article-title":"Variable elimination in linear constraints","volume":"36","author":"Chandru","year":"1993","journal-title":"The Computer Journal"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0355","series-title":"Optimization Methods for Logical Inference","author":"Chandru","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0360","series-title":"Mathematics and its applications","article-title":"Mechanical Geometry Theorem Proving","author":"Chou","year":"1988"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0365","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0211057","article-title":"Algorithms for the solution of systems of linear diophantine equations","volume":"11","author":"Chou","year":"1982","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0370","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0375","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0747-7171(89)80025-2","article-title":"Efficient solution of linear diophantine equations","volume":"8","author":"Clausen","year":"1989","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"10.1016\/B978-044450813-3\/50014-X_bb0380","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539791256325","article-title":"Improved algorithms for linear inequalities with two variables per inequality","volume":"23","author":"Cohen","year":"1994","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0385","series-title":"Automata Theory and Formal Languages. 2nd GI Conference","first-page":"134","article-title":"Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition","author":"Collins","year":"1975"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0390","series-title":"EUROCAL '85; Proceedings of the European Conference on Computer Algebra","first-page":"34","article-title":"The SAC-2 computer algebra system","author":"Collins","year":"1985"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0395","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"8","article-title":"Quantifier elimination by cylindrical algebraic decomposition - twenty years of progress","author":"Collins","year":"1998"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0400","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","article-title":"Partial cylindrical algebraic decomposition for quantifier elimination","volume":"12","author":"Collins","year":"1991","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0405","series-title":"4th Annual ESPRIT Conference, Bruxelles","article-title":"Introduction to PROLOG III","author":"Colmerauer","year":"1987"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0410","series-title":"Computational Logic: Essays in Honor of A. Robinson","first-page":"322","article-title":"Disunification: A survey","author":"Comon","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0415","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1009868906501","article-title":"A methodological view of constraint solving","volume":"4","author":"Comon","year":"1999","journal-title":"Constraints"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0420","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1994.1067","article-title":"An efficient incremental algorithm for solving systems of linear diophantine equations","volume":"113","author":"Contejean","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0425","series-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-9","article-title":"Buchberger algorithm and integer programming","author":"Conti","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0430","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","article-title":"On the complexity of cutting plane proofs","volume":"18","author":"Cook","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0435","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01582230","article-title":"Sensitivity theorems in integer linear programming","volume":"34","author":"Cook","year":"1986","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0440","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","article-title":"An implementation of the generalized basis reduction algorithm for integer programming","volume":"5","author":"Cook","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0445","first-page":"91","article-title":"Theorem-proving in arithmetic without multiplication","volume":"7","author":"Cooper","year":"1972","journal-title":"Machine Intelligence"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0450","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0455","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","article-title":"Ideals, Varieties and Algorithms","author":"Cox","year":"1992"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0460","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","article-title":"Using algebraic geometry","author":"Cox","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0465","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0470","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","article-title":"Fourier-Motzkin elimination and its dual","volume":"14","author":"Dantzig","year":"1973","journal-title":"Journal of Combinatiorial Theory, Series A"},{"issue":"1-2","key":"10.1016\/B978-044450813-3\/50014-X_bb0475","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","article-title":"Real quantifier elimination is doubly exponential","volume":"5","author":"Davenport","year":"1988","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0480","first-page":"323","article-title":"Hilbert's tenth problem. Diophantine equations: Positive aspects of a negative solution","volume":"28","author":"Davis","year":"1976"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0485","doi-asserted-by":"crossref","DOI":"10.2307\/1970289","article-title":"The decision problem for exponential Diophantine equations","volume":"74","author":"Davis","year":"1961","journal-title":"Annals of Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0490","first-page":"609","article-title":"Equality reasoning in sequent-based calculi","volume":"Vol. I","author":"Degtyarev","year":"2001"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0495","first-page":"674","article-title":"Iterative solution of problems of linear and quadratic programming","volume":"8","author":"Dikin","year":"1967","journal-title":"Soviet Math. Doklady"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0500","series-title":"Fifth Generation Computer Systems, Tokyo, 1988","article-title":"The constraint logic programming language CHIP","author":"Dincbas","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0505","doi-asserted-by":"crossref","first-page":"191","DOI":"10.2307\/1967869","article-title":"Systems of linear inequalities","volume":"20","author":"Dines","year":"1919","journal-title":"Annals of Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0510","article-title":"Reelle Quantorenelimination durch parametrisches Z\u00e4hlen von Nullstellen","author":"Dolzmann","year":"1994","journal-title":"Diploma thesis, Universit\u00e4t Passau, D-94030 Passau, Germany"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0515","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC 98","first-page":"88","article-title":"Approaches to parallel quantifier elimination","author":"Dolzmann","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0520","article-title":"Redlog User manual","author":"Dolzmann","year":"1996","journal-title":"Technical Report MIP-9616, FMI, Universit\u00e4t Passau, D-94030 Passau Germany"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0525","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/261320.261324","article-title":"Redlog: Computer algebra meets computer logic","volume":"31","author":"Dolzmann","year":"1997","journal-title":"ACM SIGSAM Bulletin"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0530","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1006031329384","article-title":"A new approach for automatic theorem proving in real geometry","volume":"21","author":"Dolzmann","year":"1998","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0535","series-title":"Algorithmic Algebra and Number Theory","first-page":"221","article-title":"Real quantifier elimination in practice","author":"Dolzmann","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0540","series-title":"Mathem. Foundations of Computer Science, Kazimierz Dolny, Poland","article-title":"Solving systems of linear diophantine equations: An algebraic approach","author":"Domenjoud","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0545","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00263448","article-title":"A technical note on AC-unification. the number of minimal unifiers of the equation \u03b1 x1 + \u2026 + \u03b1 xp =ac \u03b2 y1 + \u2026 + yq","volume":"8","author":"Domenjoud","year":"1992","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0550","series-title":"Principles and Practice of Constraint Programming - CP'95, Cassis, France","first-page":"18","article-title":"From Elliott-MacMahon to an algorithm for general linear constraints in naturals","author":"Domenjoud","year":"1995"},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb0555","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","article-title":"Hermite normal form computation using modulo determinant arithmetic","volume":"12","author":"Dormich","year":"1987","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0560","article-title":"Theorem proving modulo, Rapport de recherche 3400, INRIA","author":"Dowek","year":"1998","journal-title":"J. Autom. Reas"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0565","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0168-0072(92)90025-U","article-title":"Quantifier elimination for modules with scalar variables","volume":"57","author":"Dries","year":"1992","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0570","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0121242","article-title":"On Fourier's analysis of linear inequality systems","volume":"1","author":"Duffin","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0575","series-title":"24th International Symposium on Mathematical Foundations of Computer Scienc, MFCS'99","first-page":"92","article-title":"On the complexity of recognizing the Hilbert basis of a linear diophantine system","author":"Durand","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0580","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01585709","article-title":"Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields","volume":"53","author":"Eaves","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0585","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representatives and linear algebra","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Natl. Bur. Stand., Sect. B"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0590","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","article-title":"On the membership problem for the elementary closure of a polyhedron","volume":"19","author":"Eisenbrand","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0595","article-title":"Gomory-Chv\u00e1tal cutting planes and the elementary closure of polyhedra","author":"Eisenbrand","year":"2000","journal-title":"PhD thesis, Naturwissenschaftlich-Technische Fakult\u00e4t I, Univ. des Saarlandes"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0600","series-title":"Integer Programming and Combinatorial Optimization, IPCO 99","first-page":"137","article-title":"Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1 cube","author":"Eisenbrand","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0605","first-page":"348","article-title":"On linear homogeneous diophantine equations","volume":"34","author":"Elliott","year":"1903","journal-title":"Quarterly Journal of Pure and Applied Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0610","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jsco.1995.1041","article-title":"Efficient incremental algorithms for the sparse resultant and the mixed volume","volume":"20","author":"Emiris","year":"1995","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0615","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'97, Maui, HI","first-page":"28","article-title":"On the worst-case complexity of integer Gaussian elimination","author":"Fang","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0620","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","article-title":"The Computational Complexity of Logical Theories","author":"Ferrante","year":"1979"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0625","series-title":"5th Portuguese Conference on Artificial Intelligence, EPIA'91","first-page":"1","article-title":"Solving linear constraints on finite domains through parsing","author":"Filgueiras","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0630","series-title":"6th Portuguese Conference on AI, EPIA'93","first-page":"297","article-title":"Fast methods for solving linear diophantine equations","author":"Filgueiras","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0635","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0640","series-title":"Algebraische Unifikation","author":"Fortenbacher","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0645","first-page":"99","article-title":"Solution d'une question particuli\u00e8re du calcul des in\u00e9galit\u00e9s","author":"Fourier","year":"1826","journal-title":"Nouveau Bulletin des Sciences par la Soci\u00e9t\u00e9 Philomathique de Paris"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0650","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","article-title":"An application of simultaneous diophantine approximation in combinatorial optimization","volume":"7","author":"Frank","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0655","first-page":"173","article-title":"An algorithm for the reduction of a matrix of integers to triangular form with power complexity of computations","volume":"12","author":"Frumkin","year":"1976","journal-title":"Ekonom. i mat. Metody"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0660","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90115-3","article-title":"The complexity of Presburger arithmetic with bounded quantifier alternation depth","volume":"18","author":"F\u00fcrer","year":"1982","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0665","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'91","first-page":"122","article-title":"Computing with parametric equations","author":"Gao","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0670","series-title":"Komplexit\u00e4t von Entscheidungsproblemen","article-title":"Weitere zum Erf\u00fcllungsproblem polynomial \u00e4quivalente kombinatorische Aufgaben","author":"Gathen","year":"1976"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0675","first-page":"155","article-title":"A bound on solutions of linear integer equalities and inequalities","volume":"72","author":"Gathen","year":"1978"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0680","series-title":"Algorithms for computer algebra","author":"Geddes","year":"1992"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0685","series-title":"Polyhedral Combinatorics","first-page":"29","article-title":"On cutting planes and matrices","author":"Gerards","year":"1990"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0690","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","article-title":"\u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme, I","volume":"38","author":"G\u00f6del","year":"1931","journal-title":"Monatsh. Math. Phys."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0695","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"The undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0700","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solutions to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. AMS"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0705","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC89","first-page":"136","article-title":"Sturm-Habicht sequence","author":"Gonz\u00e1lez","year":"1989"},{"issue":"6","key":"10.1016\/B978-044450813-3\/50014-X_bb0710","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1051\/ita\/1990240605611","article-title":"Sous-r\u00e9sultants et sp\u00e9cialisation de la suite de Sturm I","volume":"24","author":"Gonz\u00e1lez","year":"1990","journal-title":"Informatique th\u00e9orique et applications"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0715","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"365","article-title":"A combinatorial algorithm solving some quantifier elimination problems","author":"Gonz\u00e1lez-Vega","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0720","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"300","article-title":"Sturm-Habicht sequences determinants and real roots of univariate polynomials","author":"Gonz\u00e1lez-Vega","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0725","series-title":"Some tapas of computer algebra","article-title":"Symbolic recipes for real solutions","author":"Gonz\u00e1lez-Vega","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0730","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01442864","article-title":"\u00dcber die Aufl\u00f6sung linearer Gleichungen mit reellen Coefficienten","volume":"6","author":"Gordan","year":"1873","journal-title":"Mathematische Annalen"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0735","series-title":"Proceedings of the workshop: \u201cComputer Algebra in Science and Engineering\u201d, Bielefeld, Aug'94","first-page":"77","article-title":"On factorized Gr\u00f6bner bases","author":"Gr\u00e4be","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0740","article-title":"The complexity of subclasses of logical theories","author":"Gr\u00e4del","year":"1987","journal-title":"Doctoral dissertation, Basel"},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb0745","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0747-7171(88)80006-3","article-title":"Complexity of deciding Tarski algebra","volume":"5","author":"Grigoriev","year":"1988","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0750","series-title":"Geometric algorithms and combinatorial optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0755","first-page":"1","article-title":"How to solve a quadratic equation in integers","volume":"89","author":"Grunewald","year":"1981"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0760","article-title":"Solving linear diophantine equations","author":"Guckenbiehl","year":"1985","journal-title":"Technical Report Memo SEKI-85-IV-KL, Univ. Kaiserslautern"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0765","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1145\/3149.3157","article-title":"Decidable problems for powerful programs","volume":"32","author":"Gurari","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0770","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1145\/322139.322152","article-title":"An NP-complete number-theoretic problem","volume":"26","author":"Gurari","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0775","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0304-3975(81)80003-5","article-title":"The complexity of the equivalence problem for two characterizations of Presburger sets","volume":"13","author":"Gurari","year":"1981","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"10.1016\/B978-044450813-3\/50014-X_bb0780","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/0220067","article-title":"Asymptotically fast triangularization of matrices over rings","volume":"20","author":"Hafner","year":"1991","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0785","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0790","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/jcss.1998.1617","article-title":"An exponential lower bound for the size of monotone real circuits","volume":"58","author":"Haken","year":"1999","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0795","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","article-title":"Constrained nonlinear 0-1 programming","volume":"5","author":"Hansen","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0800","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0024-3795(93)90241-F","article-title":"Recognizing badly presented Z-modules","volume":"192","author":"Havas","year":"1993","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0805","first-page":"87","article-title":"Hermite normal form computation for integer matrices","volume":"105","author":"Havas","year":"1994","journal-title":"Congressus Numerantium"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0810","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1006\/jsco.1996.0141","article-title":"Integer matrix diagonalization","volume":"24","author":"Havas","year":"1997","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb0815","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10586458.1998.10504362","article-title":"Extended GCD and Hermite normal form algorithms via lattice basis reduction","volume":"7","author":"Havas","year":"1998","journal-title":"Experimental Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0820","doi-asserted-by":"crossref","first-page":"101","DOI":"10.24033\/bsmf.2138","article-title":"Sur la complexit\u00e9 du principe de Tarski-Seidenberg","volume":"118","author":"Heintz","year":"1990","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0825","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0020-0190(97)00019-7","article-title":"Note on shortest and nearest lattice vectors","volume":"61","author":"Henk","year":"1997","journal-title":"Information Processing Letters"},{"issue":"3-4","key":"10.1016\/B978-044450813-3\/50014-X_bb0830","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF03322141","article-title":"The height of minimal Hilbert bases","volume":"32","author":"Henk","year":"1997","journal-title":"Result. Math."},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb0835","first-page":"49","article-title":"On minimal solutions of linear diophantine equations","volume":"41","author":"Henk","year":"2000","journal-title":"Contrib. Algebra and Geometry"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0840","series-title":"6th International Conference on Logic for Programming and Automated Reasoning, LPAR'99","first-page":"13","article-title":"On the complexity of counting the Hilbert basis of a linear diophantine system","author":"Hermann","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0845","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/crll.1851.41.191","article-title":"Sur l'introduction de variables continues dans la th\u00e9orie des nombres","volume":"41","author":"Hermite","year":"1851","journal-title":"J. reine u. angewandte Mathematik"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0850","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01208503","article-title":"\u00dcber die Theorie der algebraischen Formen","volume":"36","author":"Hilbert","year":"1890","journal-title":"Mathematische Annalen"},{"issue":"6","key":"10.1016\/B978-044450813-3\/50014-X_bb0855","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/S0097539793251876","article-title":"Simple and fast algorithms for linear and integer programs with two variables per inequality","volume":"23","author":"Hochbaum","year":"1994","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0860","article-title":"OEFAI clp(Q,R) manual, Edition 1.3.3","author":"Holzbaur","year":"1995","journal-title":"Technical Report TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0865","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"166","article-title":"An improvement of the projection operator in cylindrical algebraic decomposition","author":"Hong","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0870","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02186368","article-title":"Generalized resolution and cutting planes","volume":"12","author":"Hooker","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0875","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","article-title":"A quantitative approach to logical inference","volume":"4","author":"Hooker","year":"1988","journal-title":"Decision Support Systems"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0880","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01531033","article-title":"Generalized resolution for 0-1 linear inequalities","volume":"6","author":"Hooker","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0885","series-title":"Logic-based methods for optimization","author":"Hooker","year":"2000"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0890","article-title":"Constrained Resolution: A Complete Method for Higher Order Logic","author":"Huet","year":"1972","journal-title":"PhD thesis, Case Western Reserve University, USA"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0895","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0020-0190(78)90078-9","article-title":"An algorithm to generate the basis of solutions to homogeneous linear diophantine equations","volume":"7","author":"Huet","year":"1978","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0900","series-title":"Foundations of Software Technology and Theoretical Computer Science","first-page":"1","article-title":"Reasoning about constraints using parametric queries","author":"Huynh","year":"1990"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0905","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01535523","article-title":"Practical issues on the projection of polyhedral sets","volume":"6","author":"Huynh","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0910","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(95)00063-I","article-title":"Incremental constraint deletion in systems of linear constraints","volume":"55","author":"Huynh","year":"1995","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0915","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0218045","article-title":"Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix","volume":"18","author":"Iliopoulos","year":"1989","journal-title":"SIAM J. Computing"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0920","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/0218046","article-title":"Worst-case complexity bounds on algorithms for computing the canonical structure of infinite abelian groups and solving systems of linear diophantine equations","volume":"18","author":"Iliopoulos","year":"1989","journal-title":"SIAM J. Computing"},{"issue":"5","key":"10.1016\/B978-044450813-3\/50014-X_bb0925","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1093\/comjnl\/36.5.473","article-title":"Variable elimination for disequations in generalized linear constraint systems","volume":"36","author":"Imbert","year":"1993","journal-title":"The Computer Journal"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0930","series-title":"Principles and Practice of Constraint Programming. The Newport Papers","first-page":"245","article-title":"Fourier's elimination: which to choose","author":"Imbert","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0935","series-title":"Constraint Programming: Basics and Trends","first-page":"108","article-title":"Linear constraint solving in CLP languages","author":"Imbert","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0940","series-title":"International Symposium on Logic Programming, ISLP'94","first-page":"139","article-title":"Redundancy, variable elimination and linear disequations","author":"Imbert","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0945","series-title":"Proc. 14th ACM Symp. Principles of Programming Languages","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0950","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19\/20","author":"Jaffar","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0955","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF03037187","article-title":"Projecting CLP (R) constraints","volume":"11","author":"Jaffar","year":"1993","journal-title":"New Generation Computing"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb0960","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","article-title":"The CLP (R) language and system","volume":"14","author":"Jaffar","year":"1992","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0965","series-title":"Automated Deduction, CADE-16, Trento","first-page":"127","article-title":"A framework for flexible integration of a class of decision procedures into theorem provers","author":"Jani\u010di\u0107","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0970","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting-plane theory: disjunctive methods","volume":"1","author":"Jeroslow","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0975","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","article-title":"Progress in linear programming-based algorithms for integer programming: An exposition","volume":"12","author":"Johnson","year":"2000","journal-title":"INFORMS J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0980","series-title":"Computational Logic: Essays in Honor of A. Robinson","first-page":"257","article-title":"Solving equations in abstract algebras: A rule-based survey of unification","author":"Jouannaud","year":"1991"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb0985","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and the Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0990","article-title":"Eliminationsverfahren zur linearen und quadratischen Optimierung","author":"Kappert","year":"1994","journal-title":"Master's thesis, Universit\u00e4t Passau, FMI, Universit\u00e4t Passau"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb0995","series-title":"Principles and Practice of Constraint Programming","article-title":"An approach for solving systems of parametric polynomial equations","author":"Kapur","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1000","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'95","first-page":"187","article-title":"Comparison of various multivariate resultant formulations","author":"Kapur","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1005","series-title":"Automated Deduction in Geometry","article-title":"Automated geometric reasoning: Dixon resultants, Gr\u00f6bner bases, and characteristic sets","author":"Kapur","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1010","series-title":"Symbolic and Numerical Computation for Artificial Intelligence","article-title":"Elimination methods: An introduction","author":"Kapur","year":"1992"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1015","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(94)90192-9","article-title":"An overview of the Tecton proof system","volume":"133","author":"Kapur","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1020","article-title":"Reasoning about numbers in Tecton","author":"Kapur","year":"1994","journal-title":"Technical report, Dept. of Computer Science, State Univ. of New York, Albany"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1025","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'94","first-page":"108","article-title":"Algebraic and geometric reasoning using Dixon resultants","author":"Kapur","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1030","series-title":"16th ACM Symposium on the Theory of Computing, STOC'84","first-page":"302","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1035","article-title":"A unifying logical framework for integer linear programming and finite domain constraint programming","author":"Kasper","year":"1998","journal-title":"PhD thesis, Technische Fakult\u00e4t, Univ. des Saarlandes"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1040","series-title":"9th International Conference on Automated Deduction, CADE-9","first-page":"563","article-title":"Reasoning about systems of linear inequalities","author":"K\u00e4ufl","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1045","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Doklady"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1050","first-page":"9","article-title":"Deduction with symbolic constraints","volume":"4","author":"Kirchner","year":"1990","journal-title":"Revue d'Intelligence Artificielle"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1055","series-title":"Constraint Programming: Basics and Trends","first-page":"128","article-title":"On the use of constraints in automated deduction","author":"Kirchner","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1060","series-title":"Inequalities III","first-page":"159","article-title":"How good is the simplex algorithm?","author":"Klee","year":"1972"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1065","series-title":"Principles and Practice of Constraint Programming, CP'96, Cambridge, MA","first-page":"297","article-title":"Tractable disjunctions of linear constraints","author":"Koubarakis","year":"1996"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1070","article-title":"MAS modula-2 algebra system, interactive usage","author":"Kredel","year":"1993","journal-title":"Technical report, Universit\u00e4t Passau"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1075","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0747-7171(88)80045-2","article-title":"Computing dimension and independent sets for polynomial ideals","volume":"6","author":"Kredel","year":"1988","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb1080","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","article-title":"The computational complexity of simultaneous diophantine approximation problems","volume":"14","author":"Lagarias","year":"1985","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1085","first-page":"39","article-title":"Une borne pour les g\u00e9n\u00e9rateurs des solutions enti\u00e8res positives d'une \u00e9quation diophantienne lin\u00e9aire","volume":"305","author":"Lambert","year":"1987","journal-title":"C. R. Acad. Sci., Paris, Ser. I"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1090","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF00245019","article-title":"Non-negative integer basis algorithms for linear equations with integer coefficients","volume":"5","author":"Lankford","year":"1989","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1095","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"288","article-title":"Querying constraints","author":"Lassez","year":"1990"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1100","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00245296","article-title":"On Fourier's algorithm for linear arithmetic constraints","volume":"9","author":"Lassez","year":"1992","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0747-7171(92)90002-L","article-title":"A canonical form for generalized linear constraints","volume":"13","author":"Lassez","year":"1992","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1110","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(91)90113-B","article-title":"A new method for solving algebraic systems of positive dimension","volume":"33","author":"Lazard","year":"1991","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1115","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0747-7171(08)80086-7","article-title":"Solving zero-dimensional algebraic systems","volume":"13","author":"Lazard","year":"1992","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1120","article-title":"Canonical forms in finitely presented algebras","author":"Le Chenadec","year":"1986"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1125","series-title":"CONCUR'93","first-page":"398","article-title":"Loop parallelization in the polytope model","author":"Lengauer","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1130","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Annalen"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb1135","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1140","article-title":"Implementierung eines Verfahrens zum Z\u00e4hlen reeller Nullstellen multivariater Polynome","author":"Lippold","year":"1993","journal-title":"Diploma thesis, Universit\u00e4t Passau, D-94030 Passau, Germany"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1145","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1090\/S0002-9947-1978-0469886-1","article-title":"The diophantine problem for addition and divisibility","volume":"235","author":"Lipshitz","year":"1978","journal-title":"Trans. AMS"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1150","series-title":"Effective Methods in Algebraic Geometry, MEGA'90","first-page":"263","article-title":"Effective real Nullstellensatz and variants","author":"Lombardi","year":"1991"},{"issue":"5","key":"10.1016\/B978-044450813-3\/50014-X_bb1155","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1093\/comjnl\/36.5.450","article-title":"Applying linear quantifier elimination","volume":"36","author":"Loos","year":"1993","journal-title":"The Computer Journal"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1160","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.17.3.751","article-title":"The generalized basis reduction algorithm","volume":"17","author":"Lov\u00e1sz","year":"1992","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1165","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1170","volume":"Vol. II","author":"MacMahon","year":"1916"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1175","series-title":"Symbolic Rewriting Techniques","article-title":"String rewriting and Gr\u00f6bner bases - a general approach to monoid and group rings","author":"Madlener","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1180","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/BF01875296","article-title":"Systems of standard equations in words in an n-layer alphabet of unknowns","volume":"19","author":"Makanin","year":"1979","journal-title":"Sib. Math. J."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1185","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0022-0000(78)90044-2","article-title":"NP-complete decision problems for binary quadratics","volume":"16","author":"Manders","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1190","series-title":"Programming with constraints","author":"Marriott","year":"1998"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1195","first-page":"354","article-title":"Enumerable sets are Diophantine","volume":"11","author":"Matiyasevich","year":"1970","journal-title":"Soviet Math. Doklady"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1200","series-title":"Hilbert's Tenth Problem","author":"Matiyasevich","year":"1993"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1205","doi-asserted-by":"crossref","first-page":"353","DOI":"10.2307\/2275395","article-title":"Questions of decidability and undecidability in number theory","volume":"59","author":"Mazur","year":"1994","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1210","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1215","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0899-8248(89)90027-X","article-title":"Symbolic solution of large stationary chemical kinetics problems","volume":"1","author":"Melenk","year":"1989","journal-title":"IMPACT Comput. Sci. Eng."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1220","series-title":"Mathematics for computer algebra","author":"Mignotte","year":"1992"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1225","series-title":"Algorithmic Algebra","author":"Mishra","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1230","article-title":"Beitr\u00e4ge zur Theorie der linearen Ungleichungen","author":"Motzkin","year":"1936","journal-title":"Doctoral dissertation, Universit\u00e4t Z\u00fcrich"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1235","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","article-title":"Simplification by cooperating decision procedures","volume":"1","author":"Nelson","year":"1979","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1240","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1245","first-page":"371","article-title":"Paramodulation-based theorem proving","volume":"Vol. I","author":"Nieuwenhuis","year":"2001"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1250","series-title":"Proceedings 5th ACM Symposium on Theory of Computing","first-page":"34","article-title":"Elementary bounds for Presburger arithmetic","author":"Oppen","year":"1973"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1255","series-title":"Computer algorithms for solving linear algebraic equations: the state of the art","article-title":"Complexity of algorithms for linear systems of equations","author":"Pan","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1260","article-title":"On computing Hilbert bases via the Elliott-MacMahon algorithm","author":"Pasechnik","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1265","series-title":"Computational Algebraic Geometry","first-page":"203","article-title":"Counting real zeroes in the multivariate case","author":"Pedersen","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1270","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1025-2","article-title":"The Mathematics of Nonlinear Programming","author":"Peressini","year":"1988"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1275","article-title":"Une approche g\u00e9om\u00e9trique aux contraintes arithm\u00e9tiques quadratiques en programmation logique avec contraintes","author":"Pesant","year":"1995","journal-title":"PhD thesis, Universit\u00e9 de Montr\u00e9al"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1280","series-title":"Principles and Practice of Constraint Programming","first-page":"95","article-title":"QUAD-CLP (R): Adding the power of quadratic constraints","author":"Pesant","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1285","series-title":"User Manual","article-title":"Computing Comprehensive Gr\u00f6bner Bases using MAS","author":"Pesch","year":"1994"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1290","doi-asserted-by":"crossref","first-page":"372","DOI":"10.2307\/2275396","article-title":"Extensions of Hilbert's tenth problem","volume":"59","author":"Pheidas","year":"1994","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1295","series-title":"Machine Intellingence 7","first-page":"73","article-title":"Building-in equational theories","author":"Plotkin","year":"1972"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1300","series-title":"Foundations of Computer Science, FOCS'97, Miami Beach","first-page":"162","article-title":"Computing integral points in convex semi-algebraic sets","author":"Porkolab","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1305","series-title":"Rewriting Techniques and Applications, RTA'91","article-title":"Minimal solutions of linear diophantine systems: bounds and algorithms","author":"Pottier","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1310","article-title":"Sub-groups of Zn, standard basis, and linear diophantine systems, Technical","author":"Pottier","year":"1991","journal-title":"Report RR-1520, INRIA, Sophia-Antipolis"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1315","series-title":"Comptes rendues du ler Congres des Mathematiques des Pays Slaves","first-page":"92","article-title":"\u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik","author":"Presburger","year":"1929"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1320","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","article-title":"Lower bounds for resolution and cutting plane proofs and monotone computations","volume":"62","author":"Pudl\u00e1k","year":"1997","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1325","series-title":"Sets and Proofs, Invited papers from Logic Colloquium'97","first-page":"197","article-title":"On the complexity of the propositional calculus","author":"Pudl\u00e1k","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1330","series-title":"Symposium on the Theory of Computing, STOC'78","first-page":"320","article-title":"Presburger arithmetic with bounded quantifier alternation","author":"Reddy","year":"1978"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1335","series-title":"Discrete and computational geometry","first-page":"287","article-title":"Recent progress on the complexity of the decision problem for the reals","volume":"Vol. 6","author":"Renegar","year":"1991"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1340","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","article-title":"On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals","volume":"13","author":"Renegar","year":"1992","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1345","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(10)80004-5","article-title":"On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination","volume":"13","author":"Renegar","year":"1992","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1350","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","article-title":"On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination","volume":"13","author":"Renegar","year":"1992","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1355","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(90)90082-S","article-title":"A polynomial algorithm for solving systems of two linear diophantine equations","volume":"74","author":"Romeuf","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1360","article-title":"Algorithmes efficaces pour l'\u00e9tude des z\u00e9ros r\u00e9els des syst\u00e8mes polynomiaux","author":"Rouillier","year":"1996","journal-title":"PhD thesis, Universit\u00e9 Rennes"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1365","series-title":"Lectures on Real Geometry in memoriam of Mario Raimondo","first-page":"1","article-title":"Basic algorithms in real algebraic geometry: from Sturm theorem to the existential theory of real numbers","author":"Roy","year":"1996"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1370","series-title":"Concurrent constraint programming","author":"Saraswat","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1375","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0002-9947-1984-0742421-9","article-title":"Complexity of subcases of Presburger arithmetic","author":"Scarpellini","year":"1984","journal-title":"Trans AMS"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1380","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","article-title":"On cutting planes","volume":"9","author":"Schrijver","year":"1980","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1385","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1390","series-title":"Integer Programming and Combinatorial Optimization, IPCO'90, Waterloo, ON, Canada","article-title":"Hilbert bases, Carath\u00e9odory's theorem and combinatorial optimization","author":"Seb\u00f6","year":"1990"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1395","first-page":"31","article-title":"An elimination theory for differential algebra","volume":"3","author":"Seidenberg","year":"1956","journal-title":"Univ. California Publ. Math (N.S.)"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1400","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01900296","article-title":"Some remarks on Hilbert's Nullstellensatz","volume":"7","author":"Seidenberg","year":"1956","journal-title":"Arch. Math."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1405","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","article-title":"Optimization with disjunctive constraints","volume":"Vol. 181","author":"Sherali","year":"1980","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb1410","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":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1415","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/322123.322137","article-title":"An efficient decision procedure for arithmetic with function symbols","volume":"26","author":"Shostak","year":"1979","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"10.1016\/B978-044450813-3\/50014-X_bb1420","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2422.322411","article-title":"Deciding combinations of theories","volume":"31","author":"Shostak","year":"1984","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1425","first-page":"21","article-title":"Zur Theorie der quadratischen Formen","author":"Siegel","year":"1972","journal-title":"Nachr. Akad. Wiss. Goettingen, II. math.-phys. Kl."},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1430","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/2274856","article-title":"The undecidability of the DA-unification problem","volume":"54","author":"Siekmann","year":"1989","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1435","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'91","first-page":"112","article-title":"A theory for parametric linear systems","author":"Sit","year":"1991"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1440","series-title":"The Algorithmic Resolution of Diophantine Equations - A Computational Cookbook","author":"Smart","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1445","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1098\/rstl.1861.0016","article-title":"On systems of linear indeterminate equations and congruences","volume":"151","author":"Smith","year":"1861","journal-title":"Phil. Trans. Royal Soc. London (A)"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1450","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","article-title":"Real addition and the polynomial hierarchy","volume":"20","author":"Sontag","year":"1985","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1455","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01530796","article-title":"Subsumption and indexing in constraint query languages with linear arithmetic constraints","volume":"8","author":"Srivastava","year":"1993","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1460","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1215\/S0012-7094-73-04054-4","article-title":"Linear homogeneous diophantine equations and magic labelings of graphs","volume":"40","author":"Stanley","year":"1973","journal-title":"Duke Math. J."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1465","series-title":"Enumerative combinatorics","author":"Stanley","year":"1986"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1470","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","article-title":"Automated deduction by theory resolution","volume":"1","author":"Stickel","year":"1985","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1475","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'96","first-page":"267","article-title":"Nearly optimal algorithms for computing Smith normal forms of integer matrices","author":"Storjohann","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1480","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'96","first-page":"259","article-title":"Asymptotically fast computation of Hermite normal forms of integer matrices","author":"Storjohann","year":"1996"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1485","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numerische Mathematik"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb1490","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1287\/ijoc.3.4.269","article-title":"Incremental linear constraint solving and detection of implicit equalities","volume":"3","author":"Stuckey","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1495","article-title":"Reasoning over networks by symbolic methods","author":"Sturm","year":"1997","journal-title":"Technical Report MIP-9719, FMI, Universit\u00e4t Passau, D-94030 Passau, Germany"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1500","series-title":"Proceedings of the 15th IMACS World Congress on Scientific Computation, Modelling, and Applied Mathematics (IMACS 97)","first-page":"727","article-title":"Rounding and blending of solids by a real elimination method","author":"Sturm","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1505","series-title":"Automated Deduction in Geometry","first-page":"58","article-title":"Computational geometry problems in Redlog","author":"Sturm","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1510","series-title":"Algorithms in invariant theory","author":"Sturmfels","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1515","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/322169.322185","article-title":"Verification decidability of Presburger array programs","volume":"27","author":"Suzuki","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1520","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1525","article-title":"A decision method for elementary algebra and geometry","author":"Tarski","year":"1948-1951"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1530","doi-asserted-by":"crossref","first-page":"553","DOI":"10.2307\/2118560","article-title":"Ring-theoretic properties of certain Hecke algebras","volume":"141","author":"Taylor","year":"1995","journal-title":"Ann. Math., II. Ser."},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb1535","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.20.4.864","article-title":"A geometric Buchberger algorithm for integer programming","volume":"20","author":"Thomas","year":"1995","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1540","first-page":"533","article-title":"Gr\u00f6bner bases in integer programming","volume":"Vol. 1","author":"Thomas","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1545","article-title":"On solving linear diophantine constraints","author":"Tom\u00e1s","year":"1997","journal-title":"PhD thesis, Univ. Porto"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1550","series-title":"Rewriting Techniques and Applications, RTA-97, Sitges, Spain","first-page":"269","article-title":"Solving linear diophantine equations using the geometric structure of the solution space","author":"Tom\u00e1s","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1555","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1560","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(87)90013-7","article-title":"Computational complexities of diophantine equations with parameters","volume":"8","author":"Tung","year":"1987","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1565","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-314X(89)90014-0","article-title":"On the practical solution of the Thue equation","volume":"31","author":"Tzanakis","year":"1989","journal-title":"J. Number Theory"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1570","series-title":"Moderne Algebra II","author":"van der Waerden","year":"1940"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1575","article-title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice","author":"van Emde Boas","year":"1981","journal-title":"Technical Report 81-04, Math. Inst., Univ. Amsterdam"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1580","series-title":"Constraint satisfaction in logic programming","author":"van Hentenryck","year":"1989"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1585","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01543480","article-title":"Standard forms for rational linear arithmetic in constraint logic programming","volume":"5","author":"van Hentenryck","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"10.1016\/B978-044450813-3\/50014-X_bb1590","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/242223.242279","article-title":"Strategic directions in constraint programming","volume":"28","author":"van Hentenryck","year":"1996","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1595","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","article-title":"Semidefinite programming","volume":"38","author":"Vandenberghe","year":"1996","journal-title":"SIAM Review"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1600","series-title":"Linear programming : Foundations and extensions","author":"Vanderbei","year":"1997"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1605","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","article-title":"Quadratic programming is in NP","volume":"36","author":"Vavasis","year":"1990","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1610","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(83)90038-5","article-title":"Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories","volume":"23","author":"Volger","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1615","series-title":"Modern computer algebra","author":"von zur Gathen","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1620","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00143881","article-title":"Practical applications of constraint programming","volume":"1","author":"Wallace","year":"1996","journal-title":"Constraints"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1625","series-title":"Computational Algebraic Geometry (MEGA '92)","first-page":"301","article-title":"An elimination method based on Seidenberg's theory and its applications","author":"Wang","year":"1993"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1630","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jsco.1993.1035","article-title":"An elimination method for polynomial systems","volume":"16","author":"Wang","year":"1993","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1635","series-title":"Automatic Practical Reasoning","first-page":"147","article-title":"Reasoning about geometric problems using an elimination method","author":"Wang","year":"1995"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1640","series-title":"31th ACM Symposium on the Theory of Computing, STOC'99","first-page":"11","article-title":"A polynomial combinatorial algorithm for generalized minimum cost flow","author":"Wayne","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1645","first-page":"331","article-title":"Two model theoretic proofs of R\u00fcckert's Nullstellensatz","volume":"203","author":"Weispfenning","year":"1975","journal-title":"Transactions AMS"},{"issue":"1-2","key":"10.1016\/B978-044450813-3\/50014-X_bb1650","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(88)80003-8","article-title":"The complexity of linear problems in fields","volume":"5","author":"Weispfenning","year":"1988","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"10.1016\/B978-044450813-3\/50014-X_bb1655","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0747-7171(08)80051-X","article-title":"The complexity of almost linear diophantine problems","volume":"10","author":"Weispfenning","year":"1990","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1660","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01651327","article-title":"Existential equivalence of ordered abelian groups with parameters","volume":"29","author":"Weispfenning","year":"1990","journal-title":"Archive for Mathematical Logic"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1665","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0747-7171(92)90023-W","article-title":"Comprehensive Gr\u00f6bner bases","volume":"14","author":"Weispfenning","year":"1992","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1670","series-title":"Parametric linear and quadratic optimization by elimination, Technical Report MIP-9404, FMI","author":"Weispfenning","year":"1994"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1675","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'97, Maui, Hawaii","first-page":"48","article-title":"Complexity and uniformity of elimination in Presburger arithmetic","author":"Weispfenning","year":"1997"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1680","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002000050055","article-title":"Quantifier elimination for real algebra\u2014the quadratic case and beyond","volume":"8","author":"Weispfenning","year":"1997","journal-title":"Applicable Algebra in Engineering Communication and Computing"},{"issue":"2","key":"10.1016\/B978-044450813-3\/50014-X_bb1685","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jsco.1997.0122","article-title":"Simulation and optimization by quantifier elimination","volume":"24","author":"Weispfenning","year":"1997","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1690","series-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","first-page":"376","article-title":"A new approach to quantifier elimination for real algebra","author":"Weispfenning","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1695","series-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC'99","first-page":"129","article-title":"Mixed real-integer linear quantifier elimination","author":"Weispfenning","year":"1999"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1700","series-title":"Computer Algebra in Scientific Computation - CASC 2000","first-page":"423","article-title":"Deciding linear-transcendental problems","author":"Weispfenning","year":"2000"},{"issue":"3","key":"10.1016\/B978-044450813-3\/50014-X_bb1705","doi-asserted-by":"crossref","first-page":"443","DOI":"10.2307\/2118559","article-title":"Modular elliptic curves and Fermat's last theorem","volume":"141","author":"Wiles","year":"1995","journal-title":"Ann. Math., II. Ser"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1710","doi-asserted-by":"crossref","first-page":"681","DOI":"10.2307\/2322281","article-title":"Fourier's method of linear programming and its dual","volume":"93","author":"Williams","year":"1986","journal-title":"American Mathematical Monthly"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1715","series-title":"Integer programming","author":"Wolsey","year":"1998"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1720","series-title":"Interior point algorithms : theory and analysis","author":"Ye","year":"1997"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1725","series-title":"Proc. IMACS'93","first-page":"11","article-title":"Involution approach to solving systems of algebraic equations","author":"Zharkov","year":"1993"},{"key":"10.1016\/B978-044450813-3\/50014-X_bb1730","series-title":"Some Tapas of Computer Algebra","first-page":"168","article-title":"Gr\u00f6bner bases and integer programming","author":"Ziegler","year":"1999"}],"container-title":["Handbook of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978044450813350014X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978044450813350014X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T01:26:23Z","timestamp":1587605183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978044450813350014X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9780444508133"],"references-count":346,"URL":"https:\/\/doi.org\/10.1016\/b978-044450813-3\/50014-x","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}