What Does “Without Loss of Generality” Mean, and How Do We Detect It
暂无分享,去创建一个
[1] Scott McCallum,et al. An Improved Projection Operation for Cylindrical Algebraic Decomposition , 1985, European Conference on Computer Algebra.
[2] James H. Davenport,et al. What Does “Without Loss of Generality” Mean, and How Do We Detect It , 2017, Mathematics in Computer Science.
[3] J. van Leeuwen,et al. Theorem Proving in Higher Order Logics , 1999, Lecture Notes in Computer Science.
[4] Dongming Wang,et al. GEOTHER: A Geometry Theorem Prover , 1996, CADE.
[5] B. Kutzler,et al. On the Application of Buchberger's Algorithm to Automated Geometry Theorem Proving , 1986, J. Symb. Comput..
[6] Karem A. Sakallah,et al. Symmetry and Satisfiability , 2021, Handbook of Satisfiability.
[7] Daniel Kroening,et al. SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper) , 2016, CICM.
[8] Matthew England,et al. Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting , 2014, ICMS.
[9] John Harrison,et al. Without Loss of Generality , 2009, TPHOLs.
[10] Changbo Chen,et al. An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions , 2012, ASCM.
[11] Erika Ábrahám,et al. Building Bridges between Symbolic Computation and Satisfiability Checking , 2015, ISSAC.