Measuring the readability of geometric proofs: the area method case

DOI10.1007/S10817-022-09652-0MaRDI QIDQ6156633zbMATH OpenOpenAlexFDO

Authors Pedro Quaresma, Pierluigi Graziani

Publication date 14 June 2023

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10817-022-09652-0

zbMATH Keywords

readabilityformal proofautomated deduction in geometrygeometrography

Mathematics Subject Classification ID

General theory of linear incidence geometry and projective geometries (51A05) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A coherent logic based geometry theorem prover capable of producing formal and readable proofs
• A review and prospect of readable machine proofs for geometry theorems
• An introduction to Java geometry expert. (Extended abstract)
• Automated generation of readable proofs with geometric invariants. I: Multiple and shortest proof generation
• Automated generation of readable proofs with geometric invariants. II: Theorem proving with full-angles
• GCLC -- a tool for constructive Euclidean geometry and more than that
• Machine Proofs in Geometry
• Proof technology in mathematics research and teaching
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• Taxonomies of geometric problems
• The area method. A recapitulation
• Theorem Proving in Higher Order Logics
• Two approaches to geometrography
• Visually dynamic presentation of proofs in plane geometry. II: Automated generation of visually dynamic presentations with the full-angle method and the deductive database method

This page was built for publication: Measuring the readability of geometric proofs: the area method case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156633)