Optimising Problem Formulation for Cylindrical Algebraic Decomposition
暂无分享,去创建一个
D Aspinall | D. Aspinall | J. Carette | Petr Sojka | C. Lange | W. Windsteiger | J Carette | P Sojka | C Lange | W Windsteiger
[1] Lawrence C. Paulson,et al. MetiTarski: An Automatic Prover for the Elementary Functions , 2008, AISC/MKM/Calculemus.
[2] Christopher W. Brown. QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.
[3] Bruno Buchberger,et al. Speeding-up Quantifier Elimination by Gr?bner Bases , 1991 .
[4] George E. Collins,et al. Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..
[5] Assia Mahboubi,et al. Implementing the cylindrical algebraic decomposition within the Coq system , 2007, Mathematical Structures in Computer Science.
[6] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[7] Matthew England. An implementation of CAD in Maple utilising McCallum projection , 2013, ArXiv.
[8] James H. Davenport,et al. The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.
[9] G. E. Collins,et al. Quantifier Elimination by Cylindrical Algebraic Decomposition — Twenty Years of Progress , 1998 .
[10] Scott McCallum,et al. An Improved Projection Operation for Cylindrical Algebraic Decomposition , 1985, European Conference on Computer Algebra.
[11] Lawrence C. Paulson,et al. MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions , 2010, Journal of Automated Reasoning.
[12] Matthew England,et al. Cylindrical algebraic decompositions for boolean combinations , 2013, ISSAC '13.
[13] Scott McCallum,et al. On projection in CAD-based quantifier elimination with equational constraint , 1999, ISSAC '99.
[14] James H. Davenport,et al. Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases , 2012, AISC/MKM/Calculemus.
[15] Scott McCallum,et al. An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space , 1988, J. Symb. Comput..
[16] Lawrence C. Paulson,et al. Real Algebraic Strategies for MetiTarski Proofs , 2012, AISC/MKM/Calculemus.
[17] Thomas Sturm,et al. A New Approach for Automatic Theorem Proving in Real Geometry , 1998, Journal of Automated Reasoning.
[18] Matthew England,et al. Understanding Branch Cuts of Expressions , 2013, MKM/Calculemus/DML.
[19] Andreas Seidl,et al. Efficient projection orders for CAD , 2004, ISSAC '04.
[20] Assia Mahboubi,et al. Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination , 2012 .
[21] Matthew England,et al. Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc , 2012, 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.
[22] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[23] Christopher W. Brown,et al. On using bi-equational constraints in CAD construction , 2005, ISSAC.
[24] Changbo Chen,et al. Computing cylindrical algebraic decomposition via triangular decomposition , 2009, ISSAC '09.
[25] Daniel Lazard,et al. Quantifier Elimination: Optimal Solution for Two Classical Examples , 1988, J. Symb. Comput..
[26] James H. Davenport,et al. A repository for CAD examples , 2013, ACCA.
[27] Russell J. Bradford,et al. Practical Simplification of Elementary Functions Using CAD , 2005, Algorithmic Algebra and Logic.