Decision-making tutor: Providing on-the-job training for oil palm plantation managers

Over the years many Intelligent Tutoring Systems (ITSs) have been used successfully as teaching and training tools. Although many studies have proven the effectiveness of ITSs used in isolation, there have been very few attempts to embed ITSs with existing systems. This area of research has a lot of potential in providing life-long learning and work place training. We present DM-Tutor (Decision-Making Tutor), the first constraint-based tutor to be embedded within an existing system, the Management Information System (MIS) for oil palm plantation management. The goal of DM-Tutor is to provide scenario-based training using real-life operational data and actual plantation conditions. We present the system and the studies we have performed. The results show that DM-Tutor improved students’ knowledge significantly. The participants found DM-Tutor to be easy to understand and interesting to use

A Singular web service for geometric computations

Outsourcing algebraic computations in dynamic geometry is a possible strategy used when software distribution constraints apply. Either if the target user machine has hardware limitations, or if the computer algebra system cannot be easily (or legally) packaged inside the geometric software, this approach can solve current shortcomings in dynamic environments. We report the design and implementation of a web service using Singular, a program specialized in ideal theory and commutative algebra. Besides its canonical address, a virtual appliance and a port to a low-cost ARM based computer are also provided. Any interactive geometric environment can then outsource computations where Singular is used, and incorporate their results into the system. In particular, we illustrate the capabilities of the web service by extending current abilities of GeoGebra to deal with algebraic loci and envelopes by means of a recent algorithm for studying parametric polynomial systems

Towards a Geometry Automated Provers Competition

The geometry automated theorem proving area distinguishes itself by a large number of specific methods and implementations, different approaches (synthetic, algebraic, semi-synthetic) and different goals and applications (from research in the area of artificial intelligence to applications in education). Apart from the usual measures of efficiency (e.g. CPU time), the possibility of visual and/or readable proofs is also an expected output against which the geometry automated theorem provers (GATP) should be measured. The implementation of a competition between GATP would allow to create a test bench for GATP developers to improve the existing ones and to propose new ones. It would also allow to establish a ranking for GATP that could be used by "clients" (e.g. developers of educational e-learning systems) to choose the best implementation for a given intended use.Comment: In Proceedings ThEdu'19, arXiv:2002.1189

Automated Theorem Proving in GeoGebra: Current Achievements

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, spreadsheet, etc.), primarily focused on facilitating student experiments, and not on formal reasoning. Since including automated deduction tools in GeoGebra could bring a whole new range of teaching and learning scenarios, and since automated theorem proving and discovery in geometry has reached a rather mature stage, we embarked on a project of incorporating and testing a number of different automated provers for geometry in GeoGebra. In this paper, we present the current achievements and status of this project, and discuss various relevant challenges that this project raises in the educational, mathematical and software contexts. We will describe, first, the recent and forthcoming changes demanded by our project, regarding the implementation and the user interface of GeoGebra. Then we present our vision of the educational scenarios that could be supported by automated reasoning features, and how teachers and students could benefit from the present work. In fact, current performance of GeoGebra, extended with automated deduction tools, is already very promising—many complex theorems can be proved in less than 1 second. Thus, we believe that many new and exciting ways of using GeoGebra in the classroom are on their way

GeoGebra discovery at EGMO 2022

Este estudo mostrará a capacidade (ou incapacidade) da GeoGebra Discovery de lidar com problemas de geometria euclidiana propostos na recente Olimpíada Europeia de Matemática das Meninas (Hungria, 6 a 12 de abril de 2022). Após uma breve introdução ao contexto desta Olimpíada e ao programa GeoGebra Discovery, os problemas serão descritos e será feita uma tentativa de resolvê-los com a GeoGebra Discovery, finalmente apontando a relação entre as dificuldades encontradas pelos membros da equipe e pela GeoGebra, que podem contribuir para o estabelecimento de critérios sobre o interesse (e complexidade) dos resultados obtidos automaticamente

Portable Tool for Finalizing Freehand Drawings : Activity Analysis and Design Requirements

Within a multidisciplinary team of designers, architects and mechanical engineers, and ergonomists, we participate in a research project (ICC) in design and creative interface. This paper describes a participative and iterative approach and reviews the results of field studies involved in the design of a portable tool for finalizing freehand drawings. The results are discussed in terms of Activity Theory and its contribution to this field.Peer reviewe

From Euclidean Geometry to Knots and Nets

This document is the Accepted Manuscript of an article accepted for publication in Synthese. Under embargo until 19 September 2018. The final publication is available at Springer via https://doi.org/10.1007/s11229-017-1558-x.This paper assumes the success of arguments against the view that informal mathematical proofs secure rational conviction in virtue of their relations with corresponding formal derivations. This assumption entails a need for an alternative account of the logic of informal mathematical proofs. Following examination of case studies by Manders, De Toffoli and Giardino, Leitgeb, Feferman and others, this paper proposes a framework for analysing those informal proofs that appeal to the perception or modification of diagrams or to the inspection or imaginative manipulation of mental models of mathematical phenomena. Proofs relying on diagrams can be rigorous if (a) it is easy to draw a diagram that shares or otherwise indicates the structure of the mathematical object, (b) the information thus displayed is not metrical and (c) it is possible to put the inferences into systematic mathematical relation with other mathematical inferential practices. Proofs that appeal to mental models can be rigorous if the mental models can be externalised as diagrammatic practice that satisfies these three conditions.Peer reviewe