暂无分享,去创建一个
[1] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .
[2] Peter J. Stuckey,et al. Termination Analysis with Types Is More Accurate , 2003, ICLP.
[3] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .
[4] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .
[5] A. Tarski,et al. Sur les ensembles définissables de nombres réels , 1931 .
[6] Ashish Tiwari,et al. Termination of Linear Programs , 2004, CAV.
[7] Christian Holzbaur. OFAI clp(Q,R) Manual , 1995 .
[8] J. Marcinkowski. DATALOG SIRUPs uniform boundedness is undecidable , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[9] BasuSaugata,et al. On the combinatorial and algebraic complexity of quantifier elimination , 1996 .
[10] Patrick Cousot,et al. Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming , 2005, VMCAI.
[11] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[12] Frédéric Mesnard,et al. On Termination of Binary CLP Programs , 2004, LOPSTR.
[13] Michael J. Maher,et al. Constraint Logic Programming: A Survey , 1994, J. Log. Program..
[14] Marc Bezem,et al. Strong Termination of Logic Programs , 1991, J. Log. Program..
[15] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[16] Philippe Devienne,et al. Halting Problem of One Binary Horn Clause is Undecidable , 1993, STACS.
[17] Supratik Chakraborty. Termination Of Linear Programs , 2008 .
[18] James Renegar,et al. 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 , 1992, J. Symb. Comput..
[19] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[20] T. Koopmans. Activity analysis of production and allocation : proceedings of a conference , 1952 .
[21] Allen Van Gelder,et al. Termination detection in logic programs using argument sizes (extended abstract) , 1991, PODS.
[22] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[23] Andreas Podelski,et al. A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.
[24] Michael J. Maher,et al. The Semantics of Constraint Logic Programs , 1998, J. Log. Program..
[25] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[26] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..
[27] George E. Collins,et al. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis , 1976, SIGS.
[28] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[29] James Renegar. On the computational complexity and geome-try of the first-order theory of the reals , 1992 .
[30] Foto N. Afrati,et al. Datalog programs and their persistency numbers , 2005, TOCL.