Access the full text.
Sign up today, get DeepDyve free for 14 days.
Burak Ekici, Guy Katz, C. Keller, A. Mebsout, Andrew Reynolds, C. Tinelli (2016)
Extending SMTCoq, a Certified Checker for SMT (Extended Abstract)
J. Blanchette (2013)
Redirecting Proofs by Contradiction
Julien Narboux (2006)
Mechanical Theorem Proving in Tarski's Geometry
M. Bezem, T. Coquand (2005)
Automating Coherent Logic
A. Riazanov, A. Voronkov (2002)
The design and implementation of VAMPIREAI Commun., 15
S. Stojanovic, V. Pavlovic, Predrag Janičić (2010)
A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs
G. Sutcliffe (2009)
The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 43
C. Kaliszyk, J. Urban, J. Vyskočil (2015)
Learning to Parse on Aligned Corpora (Rough Diamond)
S. Stojanovic, Julien Narboux, M. Bezem, Predrag Janičić (2014)
A Vernacular for Coherent Logic
C. Kaliszyk, J. Urban, J. Vyskočil (2017)
Automating Formalization by Statistical and Semantic Parsing of Mathematics
F. Wiedijk (2012)
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem ProvingLog. Methods Comput. Sci., 8
P. Scott, Jacques Fleuriot (2010)
An Investigation of Hilbert's Implicit Reasoning through Proof Discovery in Idle-Time
C. Kaliszyk, J. Urban, J. Vyskočil, H. Geuvers (2014)
Developing Corpus-Based Translation Methods between Informal and Formal Mathematics: Project DescriptionArXiv, abs/1405.3451
T. Nipkow, M. Wenzel, Lawrence Paulson (2002)
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
JC Blanchette, S Böhme, LC Paulson (2013)
Extending sledgehammer with SMT solversJ. Autom. Reason., 51
John Fisher, M. Bezem (2007)
Skolem Machines and Geometric Logic
Christophe Dehlinger, Jean-François Dufourd, P. Schreck (2000)
Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry
(2011)
Automated Diagrammatic Reasoning: A proof checker for the language of E. Master's thesis
G. Huet, Christine Paulin-Mohring (2000)
The coq proof assistant reference manual
W. McCune (1997)
Solution of the Robbins ProblemJournal of Automated Reasoning, 19
M. Dick (2007)
UNDERSTANDING PROOFS
(1988)
Matematiskop 3 - Odabrani zadaci (sa rešenjima) za učenike srednjih škola
W. Schwabhäuser, Wanda Szmielew, A. Tarski (1983)
Metamathematische Methoden in der Geometrie
(1998)
Geometrija za prvi razred Matematičke gimnazije
(2016)
Automated verification of informal proofs from high school geometry
C. Kaliszyk, Alexander Krauss (2013)
Scalable LCF-Style Proof Translation
G Gonthier, A Asperti, J Avigad, Y Bertot, C Cohen, F Garillot, S Le Roux, A Mahboubi, R O’Connor, S Ould Biha, I Pasca, L Rideau, A Solovyev, E Tassi, L Théry (2013)
ITP 2013, 4th Conference on Interactive Theorem Proving, LNCS, vol. 7998
M. Wenzel (1999)
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
Jia Meng, Lawrence Paulson (2007)
Translating Higher-Order Clauses to First-Order ClausesJournal of Automated Reasoning, 40
Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers
(2011)
Automated Diagrammatic Reasoning: a proof checker for the language of E
T. Nipkow, Lawrence Paulson, M. Wenzel (2002)
Isabelle/HOL, 2283
(2011)
Proofs, Types and Lambda Calculus
G Sutcliffe (2009)
The TPTP problem library and associated infrastructure: The FOF and CNF parts, v3.5.0J. Autom. Reason., 43
Georges Gonthier, A. Asperti, J. Avigad, Yves Bertot, C. Cohen, François Garillot, Stéphane Roux, A. Mahboubi, Russell O'Connor, Sidi Biha, I. Pasca, L. Rideau, A. Solovyev, Enrico Tassi, L. Théry (2013)
A Machine-Checked Proof of the Odd Order Theorem
(1956)
Translated with introduction and commentary by Sir Thomas L. Heath, from the text of Heiberg
C. Kaliszyk, J. Vyskočil (2019)
Learning To Parse on Aligned Corpora
L. Moura, Nikolaj Bjørner (2008)
Z3: An Efficient SMT Solver
D. Hilbert, E. Townsend (1903)
The Foundations of GeometryThe Mathematical Gazette, 2
J. Harrison (1996)
HOL Light: A Tutorial Introduction
C. Kaliszyk, J. Urban (2013)
MizAR 40 for Mizar 40Journal of Automated Reasoning, 55
Predrag Janičić (2006)
GCLC - A Tool for Constructive Euclidean Geometry and More Than That
Kelvin Rojas (2015)
EuclidZ 3 – a Computational Proof-Checker for the Language E : Possible Backend for Interactive Geometric Proof Environments
Gabriel Braun, Julien Narboux (2012)
From Tarski to Hilbert
J. Avigad, Edward Dean, J. Mumma (2008)
A FORMAL SYSTEM FOR EUCLID’S ELEMENTSThe Review of Symbolic Logic, 2
(1988)
Matematiskop 3 - Odabrani zadaci (sa rešenjima) za učenike srednjih škola. Beograd, Naučna knjiga
Christoph Weidenbach, D. Dimova, Arnaud Fietzke, Rohit Kumar, M. Suda, P. Wischnewski (2009)
SPASS Version 3.5
T. Heath, Euclid (1956)
The Thirteen Books of the Elements, Vol. 2: Books 3-9
(2001)
Automated Deduction in Geometry
(2000)
Matematika za I razred srednje škole. Zavod za udžbenike i nastavna sredstva
S. Stojanovic, Julien Narboux, Predrag Janičić (2015)
Automated generation of machine verifiable and readable proofs: A case study of Tarski’s geometryAnnals of Mathematics and Artificial Intelligence, 74
Gabriel Braun, Julien Narboux (2016)
A Synthetic Proof of Pappus’ Theorem in Tarski’s GeometryJournal of Automated Reasoning, 58
M. Kinyon, R. Veroff, P. Vojtěchovský (2015)
Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction
(1956)
Translated with introduction and commentary by Sir Thomas L. Heath, from the text of Heiberg · Zbl 0071
TC Hales (2006)
Introduction to the Flyspeck Project, Mathematics, Algorithms, Proofs, Dagstuhl Seminar Proceedings, vol. 05021
S. Schulz (2002)
E - a brainiac theorem proverAI Commun., 15
(2016)
Formalization and automation of Euclidean geometry (in serbian)
M. Bezem, D. Hendriks (2007)
On the Mechanization of the Proof of Hessenberg’s Theorem in Coherent LogicJournal of Automated Reasoning, 40
J. Blanchette, Lukas Bulwahn, T. Nipkow (2011)
Automatic Proof and Disproof in Isabelle/HOL
M. Beeson, Julien Narboux, F. Wiedijk (2017)
Proof-checking EuclidAnnals of Mathematics and Artificial Intelligence, 85
J. Phillips, D. Stanovský (2010)
Automated theorem proving in quasigroup and loop theoryAI Commun., 23
Jia Meng, Claire Quigley, Lawrence Paulson (2006)
Automation for interactive proof: First prototypeInf. Comput., 204
(2016)
Automated verification of informal proofs from high school geometry (in Serbian)
(1956)
The Thirteen Books of the Elements
(2000)
Matematika za I razred srednje škole
Mladen Nikolic, Predrag Janičić (2012)
CDCL-Based Abstract State Transition System for Coherent Logic
J. Blanchette (2012)
Automatic proofs and refutations for higher-order logic
M. Ganesalingam, W. Gowers (2016)
A Fully Automatic Theorem Prover with Human-Style OutputJournal of Automated Reasoning, 58
Laura Meikle, Jacques Fleuriot (2003)
Formalizing Hilbert's Grundlagen in Isabelle/Isar
T. Hales (2005)
Introduction to the Flyspeck Project
In this paper, we propose a new approach for automated verification of informal proofs in Euclidean geometry using a fragment of first-order logic called coherent logic and a corresponding proof representation. We use a TPTP inspired language to write a semi-formal proof of a theorem, that fairly accurately depicts a proof that can be found in mathematical textbooks. The semi-formal proof is verified by generating more detailed proof objects expressed in the coherent logic vernacular. Those proof objects can be easily transformed to Isabelle and Coq proof objects, and also in natural language proofs written in English and Serbian. This approach is tested on two sets of theorem proofs using classical axiomatic system for Euclidean geometry created by David Hilbert, and a modern axiomatic system E created by Jeremy Avigad, Edward Dean, and John Mumma.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Aug 29, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.