Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant

07/06/2021
by   Nicolas Magaud, et al.
0

Recently, we developed an automated theorem prover for projective incidence geometry. This prover, based on a combinatorial approach using matroids, proceeds by saturation using the matroid rules. It is designed as an independent tool, implemented in C, which takes a geometric configuration as input and produces as output some Coq proof scripts: the statement of the expected theorem, a proof script proving the theorem and possibly some auxiliary lemmas. In this document, we show how to embed such an external tool as a plugin in Coq so that it can be used as a simple tactic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2019

Automated ZFC Theorem Proving with E

I introduce an approach for automated reasoning in first order set theor...
research
12/18/2014

GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry

Automated Theorem Proving (ATP) is an established branch of Artificial I...
research
11/20/2017

Interactive, Intelligent Tutoring for Auxiliary Constructions in Geometry Proofs

Geometry theorem proving forms a major and challenging component in the ...
research
08/26/2019

EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract)

Proof assistants often call automated theorem provers to prove subgoals....
research
03/03/2016

GeoGebra Tools with Proof Capabilities

We report about significant enhancements of the complex algebraic geomet...
research
08/11/2018

The Boyer-Moore Waterfall Model Revisited

In this paper, we investigate the potential of the Boyer-Moore waterfall...
research
05/01/2010

Electronic Geometry Textbook: A Geometric Textbook Knowledge Management System

Electronic Geometry Textbook is a knowledge management system that manag...

Please sign up or login with your details

Forgot password? Click here to reset