A. W. Bowman & A. Azzalini (2013):
Package sm: non-parametric smoothing methods (version 2.2-5).
Available at http://www.stats.gla.ac.uk/~adrian/sm.
C. Brown & J.H. Davenport (2007):
The complexity of quantifier elimination and cylindrical algebraic decomposition.
In: Proceedings of ISSAC '07.
ACM,
pp. 54–60,
doi:10.1145/1277548.1277557.
C. W. Brown (2003):
An Overview of QEPCAD B: a Tool for Real Quantifier Elimination and Formula Simplification.
Journal of Japan Society for Symbolic and Algebraic Computation 10(1),
pp. 13–22.
Christopher W. Brown (2021):
Saclib.
A GitHub project.
https://github.com/chriswestbrown/saclib.
C. Chen & M. M. Maza (2016):
Quantifier Elimination by Cylindrical Algebraic Decomposition based on Regular Chains.
Journal of Symbolic Computation 75,
pp. 74–93,
doi:10.1016/j.jsc.2015.11.008.
S. C. Chou (1988):
Mechanical Geometry Theorem Proving.
D. Reidel Publishing Company, Dordrecht, Netherlands.
S. C. Chou, X. S. Gao & J. Z. Zhang (2000):
A Deductive Database Approach To Automated Geometry Theorem Proving and Discovering.
Journal of Automated Reasoning 25(3),
pp. 219–246,
doi:10.1023/A:1006171315513.
G. E. Collins & H. Hong (1991):
Partial Cylindrical Algebraic Decomposition for Quantifier Elimination.
Journal of Symbolic Computation 12,
pp. 299–328,
doi:10.1016/S0747-7171(08)80152-6.
J.H. Davenport & J. Heintz (1988):
Real quantifier elimination is doubly exponential.
Journal of Symbolic Computation 5(1-2),
pp. 29–35,
doi:10.1016/S0747-7171(88)80004-X.
A. Dolzmann & T. Sturm (1997):
Redlog: Computer Algebra Meets Computer Logic.
ACM SIGSAM Bulletin 31(2),
pp. 2–9,
doi:10.1145/261320.261324.
H. Iwane, H. Yanami & H Anai (2014):
SyNRAC: a toolbox for solving real algebraic constraints.
In: Proceedings of ICMS-2014. LNCS, vol. 8592.
Springer, Heidelberg,
pp. 518–522.
Jianguo Jiang & Jing Zhong Zhang (2012):
A review and prospect of readable machine proofs for geometry theorems.
Journal of Systems Science and Complexity 25(4),
doi:10.1007/s11424-012-2048-3.
Zoltán Kovács (2015):
The Relation Tool in GeoGebra 5.
In: Francisco Botana & Pedro Quaresma: Automated Deduction in Geometry: 10th International Workshop, ADG 2014, Coimbra, Portugal, July 9-11, 2014, Revised Selected Papers.
Springer International Publishing,
Cham,
pp. 53–71,
doi:10.1007/978-3-319-21362-0_4.
Zoltán Kovács (2020):
Automated Detection of Interesting Properties in Regular Polygons.
Mathematics in Computer Science 14,
pp. 727–755,
doi:10.1007/s11786-020-00491-z.
Zoltán Kovács (2020):
GeoGebra Discovery.
A GitHub project.
https://github.com/kovzol/geogebra-discovery.
Zoltán Kovács & Bernard Parisse (2015):
Giac and GeoGebra – Improved Gröbner Basis Computations.
In: Jaime Gutierrez, Josef Schicho & Martin Weimann: Computer Algebra and Polynomials,
Lecture Notes in Computer Science.
Springer,
pp. 126–138,
doi:10.1007/978-3-319-15081-9_7.
Zoltán Kovács, Tomás Recio & Csilla Sólyom-Gecse (2019):
Rewriting input expressions in complex algebraic geometry provers.
Annals of Mathematics and Artificial Intelligence 85,
pp. 73–87,
doi:10.1007/s10472-018-9590-1.
K. Kusche, B. Kutzler & H. Mayr (1989):
Implementation of a geometry theorem proving package in SCRATCHPAD II.
In: James H. Davenport: Eurocal '87.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 246–257,
doi:10.1007/3-540-51517-8_123.
Tomás Recio & M. Pilar Vélez (1999):
Automatic discovery of theorems in elementary geometry.
Journal of Automated Reasoning 23,
pp. 63–82,
doi:10.1023/A:1006135322108.
Mohab Safey El Din (2007):
RAGlib: A library for real solving polynomial systems of equations and inequalities.
https://www-polsys.lip6.fr/~safey/RAGLib/.
Róbert Vajda & Zoltán Kovács (2020):
GeoGebra and theıtshape realgeom Reasoning Tool.
CEUR Workshop Proceedings,
pp. 204–219.
Available at http://ceur-ws.org/Vol-2752/paper15.pdf.
F. Vale-Enriquez & C.W. Brown (2018):
Polynomial Constraints and Unsat Cores in Tarski.
In: Mathematical Software – ICMS 2018. LNCS, vol. 10931.
Springer, Cham,
pp. 466–474,
doi:10.1007/978-3-319-96418-8_55.
D. Wang (2002):
Geother 1.1: Handling and proving geometric theorems automatically.
In: ADG 2002,
Lecture Notes in Computer Science 2930.
Springer,
pp. 194–215,
doi:10.1007/978-3-540-24616-9_12.
Wolfram Research, Inc. (2020):
Mathematica, Version 12.1.
Champaign, IL.
W. T. Wu (1978):
On the decision problem and the mechanization of theorem proving in elementary geometry.
Scientia Sinica 21,
pp. 157–179.
B. Xia (2007):
DISCOVERER: A tool for solving semi-algebraic systems.
ACM SIGSAM Bulletin 41(3),
pp. 102–103.
L. Yang, X. Hou & B. Xia (1999):
Automated Discovering and Proving for Geometric Inequalities.
In: ADG'1998, LNAI 1669.
Springer-Verlag,
pp. 30–46.
L. Yang & J. Zhang (2001):
A practical program of automated proving for a class of geometric inequalities.
In: Automated Deduction in Geometry,
Lecture Notes in Artificial Intelligence 2061.
Springer-Verlag, Berlin, Heidelberg,
pp. 41–57,
doi:10.5555/647693.731185.
Zheng Ye, Shang Ching Chou & Xiao Shan Gao (2011):
An Introduction to Java Geometry Expert.
In: Automated Deduction in Geometry.
Springer Science + Business Media,
pp. 189–195,
doi:10.1007/978-3-642-21046-4_10.
Alon Zakai (2013):
Emscripten: An LLVM-to-JavaScript Compiler.
https://github.com/kripken/emscripten/blob/master/docs/paper.pdf?raw=true.
eptcs@eptcs.org