Solving geometrical constraint systems using CLP based on linear constraint solver

DOI10.1007/3-540-61732-9_63MaRDI QIDQ6560381zbMATH OpenFDO

Authors Denis Bouhineau

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-61732-9_63

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An application of CLP: Checking the correctness of theorems in geometry
• Artificial Intelligence: Methodology, Systems, and Applications
• Geometric constraint solving with geometric transformation
• scientific article; zbMATH DE number 2080310
• Geometric constraint solving with conics and linkages

Cites work

• Decreasing the nesting depth of expressions involving square roots
• scientific article; zbMATH DE number 41286 (Why is no real title available?)
• scientific article; zbMATH DE number 555223 (Why is no real title available?)
• Proof, Completeness, Transcendentals, and Sampling
• Simplification of Nested Radicals

This page was built for publication: Solving geometrical constraint systems using CLP based on linear constraint solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560381)