Tetsuo Ida

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 8

Top Topics

Mathematical Framework

Geometric Reasoning

Top Venues

Ann. Math. Artif. Intell.

Publications

Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia
Correction to: Preface. Ann. Math. Artif. Intell. 91 (5) (2023)
Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia
Preface. Ann. Math. Artif. Intell. 91 (5) (2023)
Tetsuo Ida, Hidekazu Takahashi
A New Modeling of Classical Folds in Computational Origami. CoRR (2022)
Pascal Schreck, Tetsuo Ida, Laura Kovács
Foreword - Formalization of geometry, automated and interactive geometric reasoning. Ann. Math. Artif. Intell. 85 (2-4) (2019)
Tetsuo Ida
Models of Computation for Origami. SYNASC (2017)
Tetsuo Ida, Stephen M. Watt
Origami folds in higher-dimension. SCSS (2017)
Tetsuo Ida
Revisit of "Geometric Exercise in Paper Folding" from a Viewpoint of Computational Origami. SYNASC (2016)
Jacques D. Fleuriot, Tetsuo Ida
Preface to the special issue on geometric reasoning. Ann. Math. Artif. Intell. 77 (1-2) (2016)
Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi
Formalizing polygonal knot origami. J. Symb. Comput. 69 (2015)
Tetsuo Ida
Huzita's Basic Origami Fold in Geometric Algebra. SYNASC (2014)
Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi
Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification. SYNASC (2013)
Fadoua Ghourabi, Tetsuo Ida, Kazuko Takahashi
Logical and Algebraic Views of a Knot Fold of a Regular Heptagon. SCSS (2013)
Tetsuo Ida
Interactive vs. Automated Proofs in Computational Origami. SYNASC (2012)
Tetsuo Ida, Asem Kasem, Fadoua Ghourabi, Hidekazu Takahashi
Morley's theorem revisited: Origami construction and automated proof. J. Symb. Comput. 46 (5) (2011)
Asem Kasem, Fadoua Ghourabi, Tetsuo Ida
Origami axioms and circle extension. SAC (2011)
Cezary Kaliszyk, Tetsuo Ida
Proof Assistant Decision Procedures for Formalizing Origami. Calculemus/MKM (2011)
Tetsuo Ida, Hidekazu Takahashi
Origami fold as algebraic graph rewriting. J. Symb. Comput. 45 (4) (2010)
Fadoua Ghourabi, Tetsuo Ida, Asem Kasem
Proof Documents for Automated Origami Theorem Proving. Automated Deduction in Geometry (2010)
Tetsuo Ida
Symbolic and algebraic methods in computational origami: invited talk. ISSAC (2009)
Tetsuo Ida, Hidekazu Takahashi
Origami fold as algebraic graph rewriting. SAC (2009)
Tetsuo Ida
A Compiler for Origami Construction and Verification. SYNASC (2009)
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fadoua Ghourabi
Computational Origami Construction as Constraint Solving and Rewriting. Electron. Notes Theor. Comput. Sci. 216 (2008)
Tetsuo Ida
Graph Rewriting in Computational Origami. SYNASC (2008)
Asem Kasem, Tetsuo Ida
Computational origami environment on the web. Frontiers Comput. Sci. China 2 (1) (2008)
Fadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Asem Kasem
Logical and algebraic view of Huzita's origami axioms with applications to computational origami. SAC (2007)
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi
Modeling Origami for Computational Construction and Beyond. ICCSA (2) (2007)
Tetsuo Ida
Modeling Origami and Beyond. SYNASC (2007)
Tetsuo Ida
Tiers of webOrigami Programming. SYNASC (2006)
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem
Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. ICMS (2006)
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
Computational Origami of a Morley's Triangle. MKM (2005)
Tetsuo Ida
In memoriam: Professor Eiichi Goto. SIGSAM Bull. 39 (3) (2005)
Mircea Marin, Tetsuo Ida
Rule-Based Programming with sigma-Log. SYNASC (2005)
Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu
Proving and Constraint Solving in Computational Origami. AISC (2004)
Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Takahashi, Bruno Buchberger
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. Automated Deduction in Geometry (2004)
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
Constraint Functional Logic Programming for Origami Construction. APLAS (2003)
Tetsuo Ida, Mircea Marin, Taro Suzuki
Reducing Search Space in Solving Higher-Order Equations. Progress in Discovery Science (2002)
Tetsuo Ida
Functional Logic Origami Programming. APLAS (2002)
Tetsuo Ida
Hot Topics in Reduction Strategies - A Panelist's View. Electron. Notes Theor. Comput. Sci. 57 (2001)
Norio Kobayashi, Mircea Marin, Tetsuo Ida
Collaborative Constraint Functional Logic Programming in an Open Environment. APLAS (2001)
Tetsuo Ida, Mircea Marin, Taro Suzuki
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. EUROCAST (2001)
Qiang Li, Yike Guo, John Darlington, Tetsuo Ida
Minimised Geometric Buchberger Algorithm for Integer Programming. Ann. Oper. Res. 108 (1-4) (2001)
Mircea Marin, Tetsuo Ida
Cooperative Constraint Functional Logic Programming. WFLP (2000)
Mircea Marin, Tetsuo Ida, Taro Suzuki
Higher-order Lazy Narrowing Calculi in Perspective. WFLP (2000)
Tetsuo Ida, Mircea Marin
An Open Environment for Cooperative Equational Solving. APLAS (2000)
Mircea Marin, Tetsuo Ida, Taro Suzuki
On Reducing the Search Space of Higher-Order Lazy Narrowing. Fuji International Symposium on Functional and Logic Programming (1999)
Taro Suzuki, Koji Nakagawa, Tetsuo Ida
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language. ALP/HOA (1997)
Tetsuo Ida, Koichi Nakahara
Leftmost Outside-In Narrowing Calculi. J. Funct. Program. 7 (2) (1997)
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. ISSAC (1997)
Aart Middeldorp, Satoshi Okui, Tetsuo Ida
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167 (1&2) (1996)
Aart Middeldorp, Satoshi Okui, Tetsuo Ida
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. UNIF (1995)
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming PLILP (1995)
Satoshi Okui, Aart Middeldorp, Tetsuo Ida
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT (1995)
Taro Suzuki, Aart Middeldorp, Tetsuo Ida
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA (1995)
Makoto Amamiya, Masahiko Satoh, Akifumi Makinouchi, Ken-Ichi Hagiwara, Taiichi Yuasa, Hitoshi Aida, Kazunori Ueda, Keijiro Araki, Tetsuo Ida, Takanobu Baba
Research on programming languages for massively parallel processing. ISPAN (1994)
Myuhng Joo Kim, Chu Shik Jhon, Tetsuo Ida
G-system: A Functionally-Based Communication System Model for Parallel Processing. IFIP Congress (1) (1992)
Tetsuo Ida, Jiro Tanaka
Functional Programming with Streams, Part II. New Gener. Comput. 2 (3) (1984)
Tetsuo Ida, Akihiko Konagaya
Comparison of Closure Reduction and Combinatory Reduction Schemes. RIMS Symposia on Software Science and Engineering (1984)
Tetsuo Ida, Jiro Tanaka
Functional Programming with Streams. IFIP Congress (1983)
Tetsuo Ida
Some FP Algebra with Currying Operation. Inf. Process. Lett. 17 (5) (1983)
Eiichi Goto, Takashi Soma, N. Inada, Tetsuo Ida, Masanori Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov
Design of a Lisp Machine - FLATS. Symposium on LISP and Functional Programming (1982)
Kozo Itano, Tetsuo Ida
Software-Fault Detector for Microprocessors. SIGSMALL/SIGMOD Symposium (1981)
Eiichi Goto, Tetsuo Ida, Kei Hiraki
FLATS, a Machine for Numerical, Symbolic and Associative Computing. ISCA (1979)
Eiichi Goto, Tetsuo Ida, Takao Gunji
Parallel Hashing Algorithms. Inf. Process. Lett. 6 (1) (1977)
Tetsuo Ida, Eiichi Goto
Performance of Parallel Hash Hardware with Key Deletion. IFIP Congress (1977)