An Application of CLP: Checking the Correctness of Theorems in Geometry

Abstract : Constraint Logic Programming can be advantageously used to deal with quadratic constraints stemming from the verification of planar geometry theorems. A hybrid symbolic--numeric representation involving radicals and multiple precision rationals is used to denote the results of quadratic equations. A unification--like algorithm tests for the equality of two expressions using that representation. The proposed approach also utilizes geometric transformations to reduce the number of quadratic equations defining geometric constructions involving circles and straight lines. A large number (512) of geometry theorems has been verified using the proposed approach. Those theorems had been proven correct using a significantly more complex (exponential) approach in a treatise authored by Chou in 1988. Even though the proposed approach is based on verification -rather than strict correctness utilized by Chou- the efficiency attained is polynomial thus making the approach useful in classroom situations where a construction attempted by student has to be quickly validated or refuted.
Liste complète des métadonnées
Contributor : Denis Bouhineau <>
Submitted on : Tuesday, March 25, 2014 - 3:08:08 PM
Last modification on : Tuesday, April 16, 2019 - 10:24:37 AM
Document(s) archivé(s) le : Wednesday, June 25, 2014 - 10:46:37 AM


Files produced by the author(s)


  • HAL Id : hal-00961981, version 1



Denis Bouhineau, Laurent Trilling, Jacques Cohen. An Application of CLP: Checking the Correctness of Theorems in Geometry. Constraints, Springer Verlag, 1999, 4 (4), pp.383--405. ⟨hal-00961981⟩



Record views


Files downloads