Skip to main content

Proof Documents for Automated Origami Theorem Proving

  • Conference paper
Book cover Automated Deduction in Geometry (ADG 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6877))

Included in the following conference series:

Abstract

A proof document for origami theorem proving is a record of entire process of reasoning about origami construction and theorem proving. It is produced at the completion of origami theorem proving as a kind of proof certificate. It describes in detail how the whole process of an origami construction and the subsequent theorem proving are carried out in our computational origami system. In particular, it describes logical and algebraic transformations of the prescription of origami construction into mathematical models that in turn become amenable to computation and verification. The structure of the proof document is detailed using an illustrative example that reveals the importance of such a document in the analysis of origami construction and theorem proving.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Coq Proof Assistant, http://coq.inria.fr/

  2. Pearson, K.R., Jones, A., Morris, S.A.: Abstract Algebra and Famous Impossibilities. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  3. Alperin, R.C.: A Mathematical Theory of Origami Constructions and Numbers. New York Journal of Mathematics 6, 119–133 (2000)

    MathSciNet  MATH  Google Scholar 

  4. Buchberger, B., Dupre, C., Jebelean, T., Kriftner, F., Nakagawa, K., Văsaru, D., Windsteiger, W.: The Theorema Project: A Progress Report. In: Symbolic Computation and Automated Reasoning (Calculemus 2000), St. Andrews, Scotland, pp. 98–113 (2000)

    Google Scholar 

  5. Ghourabi, F., Ida, T.: Orikoto: A Language for Origami Construction and Theorem Proving. In: Frontiers of Computer Science in China (2010); (Submitted, the extended abstract was presented in the fifth International Conference on Origami in Science, Mathematics and Education (5OSME)

    Google Scholar 

  6. Ghourabi, F., Ida, T., Takahashi, H., Marin, M., Kasem, A.: Logical and Algebraic View of Huzita’s Origami Axioms with Applications to Computational Origami. In: Proceedings of the 22nd ACM Symposium on Applied Computing (SAC 2007), Seoul, Korea, pp. 767–772 (2007)

    Google Scholar 

  7. Huzita, H.: Axiomatic Development of Origami Geometry. In: Proceedings of the First International Meeting of Origami Science and Technology, pp. 143–158 (1989)

    Google Scholar 

  8. Ida, T., Kasem, A., Ghourabi, F., Takahashi, H.: Morley’s theorem revisited: Origami construction and automated proof. Journal of Symbolic Computation 46(5), 571–583 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ida, T., Takahashi, H., Marin, M., Ghourabi, F., Kasem, A.: Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. In: Iglesias, A., Takayama, N. (eds.) ICMS 2006. LNCS, vol. 4151, pp. 361–372. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Justin, J.: Résolution par le pliage de l’équation du troisième degré et applications géométriques. In: Proceedings of the First International Meeting of Origami Science and Technology, pp. 251–261 (1989)

    Google Scholar 

  11. Kasem, A., Ghourabi, F., Ida, T.: Origami Axioms and Circle Extension. In: Proceedings of the 26th Symposium on Applied Computing, pp. 1106–1111. ACM press (2011)

    Google Scholar 

  12. Narboux, J.: A Graphical User Interface for Formal Proofs in Geometry. Journal of Automated Reasoning 39(2), 161–180 (2007)

    Article  MATH  Google Scholar 

  13. Robu, J., Ida, T., Ţepeneu, D., Takahashi, H., Buchberger, B.: Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. In: Hong, H., Wang, D. (eds.) ADG 2004. LNCS (LNAI), vol. 3763, pp. 19–33. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Wang, D.: GEOTHER 1.1: Handling and Proving Geometric Theorems Automatically. In: Winkler, F. (ed.) ADG 2002. LNCS (LNAI), vol. 2930, pp. 194–215. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Wantzel, P.L.: Recherches sur les moyens de connaitre si un problème de géométrie peut se résoudre avec la règle et le compas. Journal de Mathématiques Pures et Appliquées, 366–372 (1984)

    Google Scholar 

  16. Wolfram, S.: The Mathematica Book, 5th edn. Wolfram Media (2003)

    Google Scholar 

  17. Wu, W.T.: Basic Principles of Mechanical Theorem Proving in Elementary Geometry. Journal of Automated Reasoning 2, 221–252 (1986)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghourabi, F., Ida, T., Kasem, A. (2011). Proof Documents for Automated Origami Theorem Proving. In: Schreck, P., Narboux, J., Richter-Gebert, J. (eds) Automated Deduction in Geometry. ADG 2010. Lecture Notes in Computer Science(), vol 6877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25070-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25070-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25069-9

  • Online ISBN: 978-3-642-25070-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics