Proving and Constraint Solving in Computational Origami

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3249, Issue , 2004, Pages 132-142

  Ida, Tetsuo ^a   Fepeneu, Dorin ^b   Buchberger, Bruno ^c   Robu, Judit ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^c BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; CODES (SYMBOLS); LOGIC PROGRAMMING;

ALGEBRAIC METHOD; COMPUTATIONAL ORIGAMI; CONSTRAINT SOLVING; MATHEMATICA; PAPER FOLDING; SYMBOLIC COMPUTATION;

COMPUTATION THEORY;

EID: 35048889115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_12     Document Type: Article

References (12)

1. Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems (An Algorithmical Criterion for the Solvability of Algebraic Systems of Equations). Aequationes mathematicae 4/3, 1970, pp. 374-383. (English translation in: Buchberger, B., and Winkler, F. (eds.), Gröbner Bases and Applications, Proceedings of the International Conference 33 Years of Gröbner Bases, 1998, Research Institute for Symbolic Computation, Johannes Kepler University, Austria, London Mathematical Society Lecture Note Series, Vol. 251, Cambridge University Press, 1998, pp. 535 -545.)
2. Buchberger, B., Dupre, C., Jebelean, T., Kriftner, F., Nakagawa, K., Vasaru, D., Windsteiger, W.: The Theorema Project: A Progress Report, In Symbolic Computation and Automated Reasoning (Proceedings of CALCULEMUS 2000, Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, August 6-7, 2000, St. Andrews, Scotland), Kerber, M. and Kohlhase, M. (eds.), A.K. Peters Publishing Co., Natick, Massachusetts, pp. 98-113.
3. Buchberger, B. and Ida, T.: Origami Theorem Proving, SFB Scientific Computing Technical Report 2003-23-Oct, Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria, 2003.
4. Chen, T. L.: Proof of the Impossibility of Trisecting an Angle with Euclidean Tools, Mathematics Magazine Vol. 39, pp. 239-241, 1966.
5. Fushimi, K.: Science of Origami, a supplement to Saiensu, Oct. 1980, p. 8 (in Japanese).
6. Geretschläger, R.: Ceometric Constructions in Origami (in Japanese, translation by Hidetoshi Fukagawa), Morikita Publishing Co., 2002.
7. Haga, K.: Origamics Part I: Fold a Square Piece of Paper and Make Geometrical Figures (in Japanese), Nihon Hyoronsha, 1999.
8. Hull, T.: Origami and Geometric Constructions, available online at http://web.menimack.edu/ thull/geoconst.html, 1997.
9. Huzita, H.: Axiomatic Development of Origami Geometry, Proceedings of the First International Meeting of Origami Science and Technology, pp. 143-158, 1989.
10. Ida, T., Marin, M. and Takahashi, H.: Constraint Functional Logic Programming for Origami Construction, Proceedings of the First Asian Symposium on Programming Languages and Systems (APLAS2003), Lecture Notes in Computer Science, Vol. 2895, pp. 73-88, 2003.
11. Robu, J.: Automated Geometric Theorem Proving, PhD Thesis, Research Institute for Symbolic Computation, Johannes Kepler University Linz, Austria, 2002.
12. Wolfram, S.: The Mathematica Book, 5th ed., Wolfram Media, 2003.