Automation of triangle straightedge-and-compass constructions using automated planning
From MaRDI portal
Computational methods for problems pertaining to geometry (51-08) Elementary problems in Euclidean geometries (51M04) Geometric constructions in real or complex geometry (51M15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites work
- Automation of triangle ruler-and-compass constructions using constraint solvers
- Compiling finite linear CSP into SAT
- Handbook of constraint programming.
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Planning for hybrid systems via satisfiability modulo theories
- Propagation via lazy clause generation
- Solving constraint satisfaction problems with SAT modulo theories
- STRIPS: A new approach to the application of theorem proving to problem solving
- Triangle Constructions with Three Located Points
- Wernick's list: a final update
This page was built for publication: Automation of triangle straightedge-and-compass constructions using automated planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872781)