A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry

Laurent Fuchs 1, * Laurent Thery 2
* Auteur correspondant
1 SIC
XLIM - XLIM, Université de Poitiers
2 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This paper presents a formalization of Grassmann-Cayley algebra that has been done in the COQ proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus' and Desargues' theorem are interactively derived. A method that automatically proves projective geometric theorems is also translated successfully into the proposed formalization.
Type de document :
Communication dans un congrès
Pascal Schreck, Julien Narboux and Jürgen Richter-Gebert. Automated Deduction in Geometry, ADG 2010, Jul 2010, Munich, Germany. Springer, 6877, pp.51--62, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-25070-5_3〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00657901
Contributeur : Laurent Fuchs <>
Soumis le : lundi 9 janvier 2012 - 14:34:35
Dernière modification le : vendredi 12 janvier 2018 - 01:54:40
Document(s) archivé(s) le : lundi 19 novembre 2012 - 13:00:56

Fichier

fuchs_thery_adg10_postproc_fin...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Laurent Fuchs, Laurent Thery. A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry. Pascal Schreck, Julien Narboux and Jürgen Richter-Gebert. Automated Deduction in Geometry, ADG 2010, Jul 2010, Munich, Germany. Springer, 6877, pp.51--62, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-25070-5_3〉. 〈hal-00657901〉

Partager

Métriques

Consultations de la notice

597

Téléchargements de fichiers

377