Using small scale automation to improve both accessibility and readability of formal proofs in geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Using small scale automation to improve both accessibility and readability of formal proofs in geometry

Pierre Boutry
  • Function : Author
  • PersonId : 2808
  • IdHAL : boutry
IGG
Pascal Schreck
  • Function : Author
  • PersonId : 864753
IGG
Gabriel Braun
  • Function : Author
  • PersonId : 938359
IGG

Abstract

This paper describes some techniques to help building formal proofs in geometry and at the same time improving readability. Rather than trying to completely automate the proving process we provide symbolic manipulations which are useful to automate the parts of the formal proof that are usually implicit in a pen and paper proof. We test our framework using some well known theorems about triangles which are taught in high-school. We also highlight the proof steps which are usually overlooked in the informal proof and that we believe should be made explicit. Our framework is based on Tarski's geometry within the Coq proof assistant, but most of the ideas presented in this paper could be applied to other axiomatic systems or proof assistants.
Fichier principal
Vignette du fichier
small-scale-automation-Tarski-proceedings.pdf (204.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00989781 , version 1 (12-05-2014)
hal-00989781 , version 2 (25-06-2014)

Identifiers

  • HAL Id : hal-00989781 , version 2

Cite

Pierre Boutry, Julien Narboux, Pascal Schreck, Gabriel Braun. Using small scale automation to improve both accessibility and readability of formal proofs in geometry. Automated Deduction in Geometry 2014, Jul 2014, Coimbra, Portugal. pp.1-19. ⟨hal-00989781v2⟩
455 View
415 Download

Share

Gmail Facebook X LinkedIn More