Showing Proofs, Assessing Difficulty with GeoGebra Discovery

Zoltán Kovács
(The Private University College of Education of the Diocese of Linz, Austria)
Tomás Recio
(Escuela Politécnica Superior, Universidad Antonio de Nebrija, Madrid, Spain)
M. Pilar Vélez
(Escuela Politécnica Superior, Universidad Antonio de Nebrija, Madrid, Spain)

In our contribution we describe some on-going improvements concerning the Automated Reasoning Tools developed in GeoGebra Discovery, providing different examples of the performance of these new features. We describe the new ShowProof command, that outputs both the sequence of the different steps performed by GeoGebra Discovery to confirm a certain statement, as well as a number intending to grade the difficulty or interest of the assertion. The proposal of this assessment measure, involving the comparison of the expression of the thesis (or conclusion) as a combination of the hypotheses, will be developed.

In Pedro Quaresma and Zoltán Kovács: Proceedings 14th International Conference on Automated Deduction in Geometry (ADG 2023), Belgrade, Serbia, 20-22th September 2023, Electronic Proceedings in Theoretical Computer Science 398, pp. 43–52.
Published: 22nd January 2024.

ArXived at: https://dx.doi.org/10.4204/EPTCS.398.8 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org