Proving mathematical theorems at the olympiad level represents a notable milestone in
human-level automated reasoning,,–, owing to their reputed difficulty among the world's best …

Geometry problem solving is a well-recognized testbed for evaluating the high-level multi-
modal reasoning capability of deep models. In most existing works, two main geometry …

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 …

This paper gives a brief introduction to the system Java Geometry Expert (JGEX). This
system consists of three parts: the drawing part, the proving and reasoning part, and the …

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 presents an algorithm for proving plane geometry theorems stated by text and
diagram in a complementary way. The problem of proving plane geometry theorems …

The aim of mathematics mechanization is to develop symbolic algorithms for manipulating
mathematical objects, proving and discovering theorems in a mechanical way. This paper …

Significant progress has been accomplished during the past decades about geometric
constraint solving, in particular thanks to its applications in industrial fields like CAD and …

Given its formal, logical and spatial properties, geometry allows an integrated framework
where model theory and proof theory approaches can be explored. The development of …