SearcharxivSearch

arXiv · 2509.02758

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Bouzinier, Sergey Trifonov, Matthew Chen, Tarun Venkatesh, Lielle Rifkin. 2025-09-02. An Ontology-Based Approach to Optimizing Geometry Problem Sets for Skill Development. https://arxiv.org/abs/2509.02758

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO