From informal to formal proofs in Euclidean geometry
- 29 August 2018
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 85 (2-4) , 89-117
Abstract
No abstract availableKeywords
Funding Information
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja (174021)
This publication has 31 references indexed in Scilit:
- Extending Sledgehammer with SMT SolversJournal of Automated Reasoning, 2013
- Scalable LCF-Style Proof TranslationLecture Notes in Computer Science, 2013
- A Machine-Checked Proof of the Odd Order Theorem2013
- A Synthesis of the Procedural and Declarative Styles of Interactive Theorem ProvingLogical Methods in Computer Science, 2012
- A FORMAL SYSTEM FOR EUCLID’SELEMENTSThe Review of Symbolic Logic, 2009
- The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 2009
- Understanding Proofs2008
- On the Mechanization of the Proof of Hessenberg’s Theorem in Coherent LogicJournal of Automated Reasoning, 2007
- Translating Higher-Order Clauses to First-Order ClausesJournal of Automated Reasoning, 2007
- HOL Light: A tutorial introduction1996