An Introduction to Automated Discovery in Geometry through Symbolic Computation

DOI10.1007/978-3-7091-0794-2_12zbMath1250.65040OpenAlexW2150070066MaRDI QIDQ2912124

Tomás Recio, María P. Vélez

Publication date: 14 September 2012

Published in: Texts & Monographs in Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-7091-0794-2_12

zbMATH Keywords

automated discoveryelementary geometry

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Euclidean geometries (general) and generalizations (51M05)

Related Items (7)

Automatic deduction in (dynamic) geometry: Loci computation ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Generalizing the Steiner-Lehmus theorem using the Gröbner cover ⋮ Towards the Automatic Discovery of Theorems in GeoGebra ⋮ Automated study of a regular trifolium ⋮ Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick ⋮ Development of automatic reasoning tools in GeoGebra

This page was built for publication: An Introduction to Automated Discovery in Geometry through Symbolic Computation