Automated generation of machine verifiable and readable proofs: A case study of Tarski’s geometry
Open Access
- 7 January 2015
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 74 (3-4) , 249-269
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Extending Sledgehammer with SMT SolversJournal of Automated Reasoning, 2013
- Proof and Computation in GeometryLecture Notes in Computer Science, 2013
- Communicating Formal Proofs: The Case of FlyspeckLecture Notes in Computer Science, 2013
- A Machine-Checked Proof of the Odd Order Theorem2013
- A FORMAL SYSTEM FOR EUCLID’SELEMENTSThe Review of Symbolic Logic, 2009
- The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 2009
- On the Mechanization of the Proof of Hessenberg’s Theorem in Coherent LogicJournal of Automated Reasoning, 2007
- Automated development of Tarski's geometryJournal of Automated Reasoning, 1989
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- What is Elementary Geometry?1959