 | 2012 |
| 21 |  | Takahito Aoto,
Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
Logical Methods in Computer Science 8(1): (2012) |
| 2011 |
| 20 |  | Takahito Aoto,
Toshiyuki Yamada,
Yuki Chiba:
Natural Inductive Theorems for Higher-Order Rewriting.
RTA 2011: 107-121 |
| 19 |  | Takahito Aoto,
Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems.
RTA 2011: 91-106 |
| 2010 |
| 18 |  | Takahito Aoto:
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling.
RTA 2010: 7-16 |
| 17 |  | Yuki Chiba,
Takahito Aoto,
Yoshihito Toyama:
Program Transformation Templates for Tupling Based on Term Rewriting.
IEICE Transactions 93-D(5): 963-973 (2010) |
| 2009 |
| 16 |  | Takahito Aoto,
Toshiyuki Yamada:
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs.
FroCos 2009: 117-132 |
| 15 |  | Takahito Aoto,
Junichi Yoshida,
Yoshihito Toyama:
Proving Confluence of Term Rewriting Systems Automatically.
RTA 2009: 93-102 |
| 2008 |
| 14 |  | Takahito Aoto:
Sound Lemma Generation for Proving Inductive Validity of Equations.
FSTTCS 2008: 13-24 |
| 2006 |
| 13 |  | Takahito Aoto:
Dealing with Non-orientable Equations in Rewriting Induction.
RTA 2006: 242-256 |
| 12 |  | Yuki Chiba,
Takahito Aoto:
RAPT: A Program Transformation System Based on Term Rewriting.
RTA 2006: 267-276 |
| 2005 |
| 11 |  | Yuki Chiba,
Takahito Aoto,
Yoshihito Toyama:
Program transformation by templates based on term rewriting.
PPDP 2005: 59-69 |
| 10 |  | Takahito Aoto,
Toshiyuki Yamada:
Dependency Pairs for Simply Typed Term Rewriting.
RTA 2005: 120-134 |
| 2004 |
| 9 |  | Takahito Aoto,
Toshiyuki Yamada,
Yoshihito Toyama:
Inductive Theorems for Higher-Order Rewriting.
RTA 2004: 269-284 |
| 2003 |
| 8 |  | Takahito Aoto,
Toshiyuki Yamada:
Termination of Simply Typed Term Rewriting by Translation and Labelling.
RTA 2003: 380-394 |
| 2001 |
| 7 |  | Takahito Aoto:
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems.
Journal of Functional and Logic Programming 2001(11): (2001) |
| 1999 |
| 6 |  | Takahito Aoto:
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic.
Journal of Logic, Language and Information 8(2): 217-242 (1999) |
| 5 |  | Takahito Aoto,
Hiroyuki Shirasu:
On the Finite Model Property of Intuitionistic Modal Logics over MIPC.
Math. Log. Q. 45: 435-448 (1999) |
| 1998 |
| 4 |  | Takahito Aoto:
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems.
PLILP/ALP 1998: 250-265 |
| 3 |  | Takahito Aoto,
Yoshihito Toyama:
Termination Transformation by Tree Lifting Ordering.
RTA 1998: 256-270 |
| 1997 |
| 2 |  | Takahito Aoto,
Yoshihito Toyama:
On Composable Properties of Term Rewriting Systems.
ALP/HOA 1997: 114-128 |
| 1 |  | Takahito Aoto,
Yoshihito Toyama:
Persistency of Confluence.
J. UCS 3(11): 1134-1147 (1997) |