The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …

The area method for Euclidean constructive geometry was proposed by Chou et al. in the
early 1990's. The method produces human-readable proofs and can efficiently prove many …

We present a theorem prover ArgoCLP based on coherent logic that can be used for
generating both readable and formal (machine verifiable) proofs in various theories …

The area method for Euclidean constructive geometry was proposed by Chou, Gao and
Zhang in the early 1990's. The method can efficiently prove many non-trivial geometry …

We propose an approach to generate geometric theorems from electronic images of
diagrams automatically. The approach makes use of techniques of Hough transform to …

Using techniques from the fields of symbolic computation and satisfiability checking we
verify one of the cases used in the landmark result that projective planes of order ten do not …

We describe our ongoing project of formalization of algebraic methods for geometry theorem
proving (Wu's method and the Groebner bases method), their implementation and …

Formalizing geometry theorems in a proof assistant like Coq is challenging. As emphasized
in the literature, the non-degeneracy conditions lead to long technical proofs. In addition …

We study two different descriptions of incidence projective geometry: a synthetic,
mathematics-oriented one and a more practical, computation-oriented one, based on the …

This paper presents a formalization of Grassmann-Cayley algebra [6] that has been done in
the COQ [2] proof assistant. The formalization is based on a data structure that represents …