Towards Generating Controllable and Solvable Geometry Problem by Leveraging Symbolic Deduction Engine
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910982842875904 |
|---|---|
| author | Jiang, Zhuoxuan Zhang, Tianyang Peng, Peiyan Chen, Jing Xun, Yinong Zhang, Haotian Li, Lichi Li, Yong Zhang, Shaohua |
| author_facet | Jiang, Zhuoxuan Zhang, Tianyang Peng, Peiyan Chen, Jing Xun, Yinong Zhang, Haotian Li, Lichi Li, Yong Zhang, Shaohua |
| contents | Generating high-quality geometry problems is both an important and challenging task in education. Compared to math word problems, geometry problems further emphasize multi-modal formats and the translation between informal and formal languages. In this paper, we introduce a novel task for geometry problem generation and propose a new pipeline method: the Symbolic Deduction Engine-based Geometry Problem Generation framework (SDE-GPG). The framework leverages a symbolic deduction engine and contains four main steps: (1) searching a predefined mapping table from knowledge points to extended definitions, (2) sampling extended definitions and performing symbolic deduction, (3) filtering out unqualified problems, and (4) generating textual problems and diagrams. Specifically, our method supports to avoid inherent biases in translating natural language into formal language by designing the mapping table, and guarantees to control the generated problems in terms of knowledge points and difficulties by an elaborate checking function. With obtained formal problems, they are translated to natural language and the accompanying diagrams are automatically drew by rule-based methods. We conduct experiments using real-world combinations of knowledge points from two public datasets. The results demonstrate that the SDE-GPG can effectively generate readable, solvable and controllable geometry problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_02565 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Towards Generating Controllable and Solvable Geometry Problem by Leveraging Symbolic Deduction Engine Jiang, Zhuoxuan Zhang, Tianyang Peng, Peiyan Chen, Jing Xun, Yinong Zhang, Haotian Li, Lichi Li, Yong Zhang, Shaohua Artificial Intelligence Generating high-quality geometry problems is both an important and challenging task in education. Compared to math word problems, geometry problems further emphasize multi-modal formats and the translation between informal and formal languages. In this paper, we introduce a novel task for geometry problem generation and propose a new pipeline method: the Symbolic Deduction Engine-based Geometry Problem Generation framework (SDE-GPG). The framework leverages a symbolic deduction engine and contains four main steps: (1) searching a predefined mapping table from knowledge points to extended definitions, (2) sampling extended definitions and performing symbolic deduction, (3) filtering out unqualified problems, and (4) generating textual problems and diagrams. Specifically, our method supports to avoid inherent biases in translating natural language into formal language by designing the mapping table, and guarantees to control the generated problems in terms of knowledge points and difficulties by an elaborate checking function. With obtained formal problems, they are translated to natural language and the accompanying diagrams are automatically drew by rule-based methods. We conduct experiments using real-world combinations of knowledge points from two public datasets. The results demonstrate that the SDE-GPG can effectively generate readable, solvable and controllable geometry problems. |
| title | Towards Generating Controllable and Solvable Geometry Problem by Leveraging Symbolic Deduction Engine |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2506.02565 |