After half a century research, the mechanical theorem proving in geometries has become an
active research topic in the automated reasoning field. This review involves three …

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 …

This paper describes part of the formalization of Hilbert's Grundlagen der Geometrie in the
higher order logic of Isabelle/Isar, an extension of the interactive theorem prover Isabelle …

This paper describes the mechanization of the proofs of the first height chapters of
Schwabäuser, Szmielew and Tarski's book: Metamathematische Methoden in der …

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 …

We present in this paper the development of a decision procedure for affine plane geometry
in the Coq proof assistant. Among the existing decision methods, we have chosen to …

In this paper, we report on the formal proof that Hilbert's axiom system can be derived from
Tarski's system. For this purpose we mechanized the proofs of the first twelve chapters of …

This paper describes the formalization of the arithmetization of Euclidean plane geometry in
the Coq proof assistant. As a basis for this work, Tarski's system of geometry was chosen for …

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 …