| |
| 2007 | ||
|---|---|---|
| 6 | EE | Keiichirou Kusakari, Masahiko Sakai: Enhancing dependency pair method using strong computability in simply-typed term rewriting. Appl. Algebra Eng. Commun. Comput. 18(5): 407-431 (2007) |
| 5 | EE | Keiichirou Kusakari, Yuki Chiba: A Higher-Order Knuth-Bendix Procedure and Its Applications. IEICE Transactions 90-D(4): 707-715 (2007) |
| 2006 | ||
| 4 | EE | Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama: Elimination Transformations for Associative-Commutative Rewriting Systems. J. Autom. Reasoning 37(3): 205-229 (2006) |
| 2005 | ||
| 3 | EE | Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe: Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Transactions 88-D(12): 2715-2726 (2005) |
| 2 | EE | Masahiko Sakai, Keiichirou Kusakari: On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. IEICE Transactions 88-D(3): 583-593 (2005) |
| 1999 | ||
| 1 | Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama: Argument Filtering Transformation. PPDP 1999: 47-61 | |
| 1 | Yuki Chiba | [5] |
| 2 | Masaki Nakamura | [1] [4] |
| 3 | Toshiki Sakabe | [3] |
| 4 | Masahiko Sakai | [2] [3] [6] |
| 5 | Yoshihito Toyama | [1] [4] |