Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This paper proposes an ontology-based framework to automate the annotation and optimization of geometry problem sets for educational purposes. By utilizing solution graphs that map skill dependencies, it aims to streamline curriculum design and reduce teacher workload in validating student work through AI-driven proof verification. The research addresses core challenges in representing complex mathematical knowledge within automated learning systems.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

An Ontology-Based Approach to Optimizing Geometry Problem Sets for Skill Development

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2509.02758v3 Announce Type: replace-cross Abstract: Euclidean geometry has historically played a central role in cultivating logical reasoning and abstract thinking within mathematics education, but has experienced waning emphasis in recent curricula. The resurgence of interest, driven by advances in artificial intelligence and educational technology, has highlighted geometry's potential to develop essential cognitive skills and inspired new approaches to automated problem solving and proof verification. This article presents an ontology-based framework for annotating and optimizing geometry problem sets, originally developed in the 1990s. The ontology systematically classifies geometric problems, solutions, and associated skills into interlinked facts, objects, and methods, supporting granular tracking of student abilities and facilitating curriculum design. The core concept of 'solution graphs': directed acyclic graphs encoding multiple solution pathways and skill dependencies enables alignment of problem selection with instructional objectives. The framework has been tested in practice through the annotation of thousands of problems over three decades. We contend that our approach addresses longstanding challenges in representing dynamic, procedurally complex mathematical knowledge. We conclude by articulating a research agenda: the open problems of automated problem annotation and solution validation, whose resolution would reduce the time teachers spend validating student work and enable interactive feedback for self-learners.

Abstract:Euclidean geometry has historically played a central role in cultivating logical reasoning and abstract thinking within mathematics education, but has experienced waning emphasis in recent curricula. The resurgence of interest, driven by advances in artificial intelligence and educational technology, has highlighted geometry's potential to develop essential cognitive skills and inspired new approaches to automated problem solving and proof verification. This article presents an ontology-based framework for annotating and optimizing geometry problem sets, originally developed in the 1990s. The ontology systematically classifies geometric problems, solutions, and associated skills into interlinked facts, objects, and methods, supporting granular tracking of student abilities and facilitating curriculum design. The core concept of 'solution graphs': directed acyclic graphs encoding multiple solution pathways and skill dependencies enables alignment of problem selection with instructional objectives. The framework has been tested in practice through the annotation of thousands of problems over three decades. We contend that our approach addresses longstanding challenges in representing dynamic, procedurally complex mathematical knowledge. We conclude by articulating a research agenda: the open problems of automated problem annotation and solution validation, whose resolution would reduce the time teachers spend validating student work and enable interactive feedback for self-learners.

History and Overview (math.HO); Artificial Intelligence (cs.AI)

arXiv:2509.02758 [math.HO]

(or arXiv:2509.02758v3 [math.HO] for this version)

Text integral sub licența deschisă a publicației · 208 cuvinte

Subiecte conexe