Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving

Résumé

Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn a conjecture with missing assumptions and with an under-specified goal into a proper theorem. Also, the proposed framework can help in completing a proof sketch into a human-readable and machine-checkable proof. Our approach is focused on synthetic geometry, and uses coherent logic and constraint solving. The proposed approach is uniform for all three kinds of tasks, flexible and, to our knowledge, unique such approach.
Fichier principal
Vignette du fichier
adg_completion_main.pdf (323.18 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04226900 , version 1 (03-10-2023)

Identifiants

  • HAL Id : hal-04226900 , version 1

Citer

Salwa Tabet Gonzalez, Predrag Janičić, Julien Narboux. Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving. Automated Deduction in Geometry 2023, Vesna Marinkovic; Danijela Simić; Sana Stojanović Đurđević; Milan Banković, Sep 2023, Belgrade, Serbia. ⟨hal-04226900⟩
62 Consultations
52 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More