Solving Geometrical Constraint Systems Using CLP Based on Linear Constraint Solver
Résumé
Solving Geometrical Constraint Systems Using CLP Based on Linear Constraint Solver introduces and proposes a solution for two problems: a method to solve mixed constraints, a representation for constructible numbers. A survey over 512 theorems of euclidean geometry shows that this solution is appropriate. Application to Tutoring System in geometry is considered.
Origine : Fichiers produits par l'(les) auteur(s)