Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving
Open Access
- 22 January 2024
- journal article
- research article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 398, 21-37
Abstract
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.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Combining Pencil/Paper Proofs and Formal Proofs, A Challenge for Artificial Intelligence and Mathematics Education2022
- Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis2020
- A Vernacular for Coherent Logic2014
- First-Order Theorem Proving and Vampire2013
- Encoding First Order Proofs in SAT2007
- ABDUCTIVE REASONING2006
- Automating Coherent LogicLecture Notes in Computer Science, 2005
- The Projection of Quasi Variety and Its Application on Geometric Theorem Proving and Formula DeductionLecture Notes in Computer Science, 2004
- Abduction in Logic Programming2002
- Extending abduction from propositional to first-order logic1991