2012/07/18 by Vesna Marinković, Vesna Marinkovic, Marinkovic, Vesna +3
Computer Science · Engineering · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Robotic Mechanisms and Dynamics #cs.AI
paper · pdf · doi:10.48550/arxiv.1207.4432
arxiv created 2012/07/18 · openalex publication_date 2012/07/18 · arxiv updated 2012/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Straightedge and compass construction problems are one of the oldest and most challenging problems in elementary mathematics. The central challenge, for a human or for a computer program, in solving construction problems is a huge search space. In this paper we analyze one family of triangle construction problems, aiming at detecting a small core of the underlying geometry knowledge. The analysis leads to a small set of needed definitions, lemmas and primitive construction steps, and consequently, to a simple algorithm for automated solving of problems from this family. The same approach can be applied to other families of construction problems.