- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| c14 |      | Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike: Deterministic-Rule Programs on Specialization Systems: Clause-Model Semantics. ICSECS (3) 2011: 702-716 |
| 2007 | ||
| j6 | | Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Katsunori Miura: Infinite Computation in the Equivalent Transformation Model. JACIII 11(2): 176-186 (2007) |
| j5 | | Ekawit Nantajeewarawat, Kiyoshi Akama, Hidekatsu Koike: Expanding Transformation: A Basis for Correctness Verification of Rewriting Rules. JACIII 11(5): 478-490 (2007) |
| c13 | | Hidekatsu Koike, Kiyoshi Akama, Chiharu Ishikawa, Nagatomo Nakamura, Shinya Watanabe: Toward a software development model for automatic marking software. SIGUCCS 2007: 190-193 |
| 2006 | ||
| j4 | | Hidekatsu Koike, Kiyoshi Akama, Hiroshi Mabuchi: Dynamic Interaction of Syntactic and Semantic Analyses Based on the Equivalent Transformation Computation Model. JACIII 10(3): 302-311 (2006) |
| j3 | | Yoshinori Shigeta, Kiyoshi Akama, Hiroshi Mabuchi, Hidekatsu Koike: Converting Constraint Handling Rules to Equivalent Transformation Rules. JACIII 10(3): 339-348 (2006) |
| c12 | | Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike: Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method. Ershov Memorial Conference 2006: 41-54 |
| c11 | | Hidekatsu Koike, Kiyoshi Akama, Hiko Morita, Katsunori Miura: Using an automatic marking system for programming courses. SIGUCCS 2006: 173-178 |
| 2005 | ||
| c10 |  | Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Takahiko Ishikawa: Correctness Proof for Equivalent Transformation of Equality Constraints on an Interval-Variable Domain. IC-AI 2005: 627-636 |
| c9 | | Hidekatsu Koike, Takahiko Ishikawa, Kiyoshi Akama, Masaki Chiba, Katsunori Miura: Developing an e-learning System which enhances students' academic motivation. SIGUCCS 2005: 147-150 |
| c8 | | Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Takahiko Ishikawa: Problem solving by equivalent transformation of negative constraints. SMC 2005: 357-363 |
| 2003 | ||
| j2 | | Hiroshi Mabuchi, Kiyoshi Akama, Takahiko Ishikawa, Hidekatsu Koike: Integration of Syntactic Analysis and Semantic Interpretation Based on Equivalent Transformation. JACIII 7(3): 306-314 (2003) |
| 2002 | ||
| c7 | | E. Boyd, Kiyoshi Akama, Takahiko Ishikawa, Hidekatsu Koike: Dynamic Interaction of Syntactic and Semantic Analysis by Equivalent Transformation. IC-AI 2002: 1040-1046 |
| c6 | | Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike: Program Synthesis Based on the Equivalent Transformation Computation Model. LOPSTR 2002: 278-279 |
| 2001 | ||
| j1 | | Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike: A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation. Electr. Notes Theor. Comput. Sci. 59(4): 255-270 (2001) |
| c5 | | Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi: A Theoretical Foundation of Program Synthesis by Equivalent Transformation. Ershov Memorial Conference 2001: 131-139 |
| c4 | | Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi: Equivalent Transformation by Safe Extension of Data Structures. Ershov Memorial Conference 2001: 140-148 |
| 2000 | ||
| c3 | | Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Yoshinori Shigeta: Synthesis of Conversion Rules by Expanding Knowledge Representation. Artificial Intelligence and Soft Computing 2000: 434-440 |
| c2 | | Hiroshi Mabuchi, Kiyoshi Akama, Yoshinori Shigeta, Hidekatsu Koike: Semantic Interpretation by Rule-based Equivalent Transformation. Artificial Intelligence and Soft Computing 2000: 472-478 |
| c1 | | Yoshinori Shigeta, Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi: Unreachability for a Class of Rewriting Systems using Two Homomorphisms. Artificial Intelligence and Soft Computing 2000: 494-500 |
Data released under the ODC-BY 1.0 license — See also our legal information page