Constructibility classes for triangle location problems

DOI10.1007/s11786-016-0255-3zbMath1342.51017OpenAlexW2306591146MaRDI QIDQ294373

Vesna Marinković, Predrag Janičić, Pascal Schreck

Publication date: 16 June 2016

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0255-3

zbMATH Keywords

reductionautomated problem solvingstraightedge-and-compass construction problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Geometric constructions in real or complex geometry (51M15)

Related Items (2)

Using jointly geometry and algebra to determine RC-constructibility ⋮ On the mechanization of straightedge and compass constructions

Uses Software

• GCLC
• URSA
• ArgoTriCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher order rule characterization of heuristics of compass and straight edge constructions in geometry
• Towards Understanding Triangle Construction Problems
• URSA: A System for Uniform Reduction to SAT
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems
• On the construction of a triangle from the feet of its angle bisectors
• Triangle Constructions with Three Located Points
• Carlyle Circles and the Lemoine Simplicity of Polygon Constructions
• Update on William Wernick's "Triangle Constructions with Three Located Points"

This page was built for publication: Constructibility classes for triangle location problems