Solving olympiad geometry without human demonstrations
Proving mathematical theorems at the olympiad level represents a notable milestone in
human-level automated reasoning,,–, owing to their reputed difficulty among the world's best …
human-level automated reasoning,,–, owing to their reputed difficulty among the world's best …
Automated theorem proving in GeoGebra: Current achievements
F Botana, M Hohenwarter, P Janičić, Z Kovács… - Journal of Automated …, 2015 - Springer
GeoGebra is an open-source educational mathematics software tool, with millions of users
worldwide. It has a number of features (integration of computer algebra, dynamic geometry …
worldwide. It has a number of features (integration of computer algebra, dynamic geometry …
Synthesizing geometry constructions
In this paper, we study the problem of automatically solving ruler/compass based geometry
construction problems. We first introduce a logic and a programming language for …
construction problems. We first introduce a logic and a programming language for …
A review and prospect of readable machine proofs for geometry theorems
J Jiang, J Zhang - Journal of Systems Science and Complexity, 2012 - Springer
After half a century research, the mechanical theorem proving in geometries has become an
active research topic in the automated reasoning field. This review involves three …
active research topic in the automated reasoning field. This review involves three …
Automated generation of readable proofs with geometric invariants: I. Multiple and shortest proof generation
SC Chou, XS Gao, JZ Zhang - Journal of Automated Reasoning, 1996 - Springer
In this series of papers, we discuss how to use a fixed set of high level geometry lemmas or
rules related to geometric invariants, such as area, full-angle, etc., to produce short and …
rules related to geometric invariants, such as area, full-angle, etc., to produce short and …
A deductive database approach to automated geometry theorem proving and discovering
SC Chou, XS Gao, JZ Zhang - Journal of Automated Reasoning, 2000 - Springer
We report our effort to build a geometry deductive database, which can be used to find the
fixpoint for a geometric configuration. The system can find all the properties of the …
fixpoint for a geometric configuration. The system can find all the properties of the …
Notes on triangular sets and triangulation-decomposition algorithms I: Polynomial systems
E Hubert - International Conference on Symbolic and Numerical …, 2001 - Springer
This is the first in a series of two tutorial articles devoted to triangulation-decomposition
algorithms. The value of these notes resides in the uniform presentation of triangulation …
algorithms. The value of these notes resides in the uniform presentation of triangulation …
[图书][B] The mathematica guidebook for graphics
M Trott - 2017 - books.google.com
Mathematica is today's most advanced technical computing system. It features a rich
programming environment, two-and three-dimensional graphics capabilities and hundreds …
programming environment, two-and three-dimensional graphics capabilities and hundreds …
[图书][B] Handbook of geometric constraint systems principles
M Sitharam, AS John, J Sidman - 2018 - taylorfrancis.com
The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …
used principal mathematical and computational tools and techniques of the geometric …