Takahito Aoto - RankMe

56 papers A 2B 6C 11Journal 15Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version). CoRR Takahito Aoto, Naoki Nishida, Jonas Schöpf
2025	J	`jnl`	Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version). CoRR Kanta Takahata, Jonas Schöpf, Naoki Nishida, Takahito Aoto
2025	C	`conf`	Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms. LOPSTR Kanta Takahata, Jonas Schöpf, Naoki Nishida, Takahito Aoto
2025	J	`jnl`	Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version). CoRR Kanta Takahata, Jonas Schöpf, Naoki Nishida, Takahito Aoto
2025	C	`conf`	Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations. PPDP Kanta Takahata, Jonas Schöpf, Naoki Nishida, Takahito Aoto
2024	J	`jnl`	Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version). CoRR Takahito Aoto, Naoki Nishida, Jonas Schöpf
2024	B	`conf`	Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD Takahito Aoto, Naoki Nishida, Jonas Schöpf
2024	C	`conf`	Proving Uniqueness of Normal Forms w.r.t Reduction of Term Rewriting Systems. LOPSTR Takahito Aoto
2023	—	`conf`	A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems. FroCoS Ryota Haga, Yuki Kagaya, Takahito Aoto
2021	C	`conf`	A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. ICTAC Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto
2021	C	`conf`	Commutative Rational Term Rewriting. LATA Mamoru Ishizuka, Takahito Aoto, Munehiro Iwami
2021	—	`conf`	Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. FSTTCS Kentaro Kikuchi, Takahito Aoto
2020	B	`conf`	A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems. FSCD Masaomi Yamaguchi, Takahito Aoto
2020	C	`conf`	Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables. LOPSTR Kentaro Kikuchi, Takahito Aoto
2019	—	`conf`	Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. FroCos Takahito Aoto, Yoshihito Toyama
2019	C	`conf`	Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation. PPDP Kentaro Kikuchi, Takahito Aoto, Isao Sasano
2018	J	`jnl`	Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. CoRR Takahito Aoto, Yoshihito Toyama
2018	B	`conf`	Confluence Competition 2018. FSCD Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
2017	B	`conf`	Improving Rewriting Induction Approach for Proving Ground Confluence. FSCD Takahito Aoto, Yoshihito Toyama, Yuta Kimura
2017	—	`conf`	Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. FroCoS Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2016	—	`conf`	Critical Pair Analysis in Nominal Rewriting. SCSS Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2016	B	`conf`	Ground Confluence Prover based on Rewriting Induction. FSCD Takahito Aoto, Yoshihito Toyama
2016	A	`conf`	Nominal Confluence Tool. IJCAR Takahito Aoto, Kentaro Kikuchi
2015	A	`conf`	Confluence Competition 2015. CADE Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl
2015	—	`conf`	Confluence of Orthogonal Nominal Rewriting Systems Revisited. RTA Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2015	C	`conf`	Correctness of Context-Moving Transformations for Term Rewriting Systems. LOPSTR Koichi Sato, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama
2014	C	`conf`	Decision Procedures for Proving Inductive Theorems without Induction. PPDP Takahito Aoto, Sorin Stratulat
2014	—	`conf`	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. RTA-TLCA Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida
2013	—	`conf`	Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering. FroCos Takahito Aoto
2013	C	`conf`	Termination of Rule-Based Calculi for Uniform Semi-Unification. LATA Takahito Aoto, Munehiro Iwami
2012	J	`jnl`	A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems Log. Methods Comput. Sci. Takahito Aoto, Yoshihito Toyama
2012	J	`jnl`	Preface. Theor. Comput. Sci. Takahito Aoto, Aart Middeldorp
2012	B	`conf`	Rational Term Rewriting Revisited: Decidability and Confluence. ICGT Takahito Aoto, Jeroen Ketema
2011	—	`conf`	A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. RTA Takahito Aoto, Yoshihito Toyama
2011	—	`conf`	Natural Inductive Theorems for Higher-Order Rewriting. RTA Takahito Aoto, Toshiyuki Yamada, Yuki Chiba
2010	—	`conf`	Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling. RTA Takahito Aoto
2010	J	`jnl`	Program Transformation Templates for Tupling Based on Term Rewriting. IEICE Trans. Inf. Syst. Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2009	—	`conf`	Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. FroCoS Takahito Aoto, Toshiyuki Yamada
2009	—	`conf`	Proving Confluence of Term Rewriting Systems Automatically. RTA Takahito Aoto, Junichi Yoshida, Yoshihito Toyama
2008	J	`jnl`	Automatic Construction of Program Transformation Templates. Inf. Media Technol. Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2008	—	`conf`	Sound Lemma Generation for Proving Inductive Validity of Equations. FSTTCS Takahito Aoto
2008	J	`jnl`	Soundness of Rewriting Induction Based on an Abstract Principle. Inf. Media Technol. Takahito Aoto
2007	J	`jnl`	Program Transformation by Templates: A Rewriting Framework. Inf. Media Technol. Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2006	—	`conf`	Dealing with Non-orientable Equations in Rewriting Induction. RTA Takahito Aoto
2006	—	`conf`	RAPT: A Program Transformation System Based on Term Rewriting. RTA Yuki Chiba, Takahito Aoto
2005	—	`conf`	Dependency Pairs for Simply Typed Term Rewriting. RTA Takahito Aoto, Toshiyuki Yamada
2005	C	`conf`	Program transformation by templates based on term rewriting. PPDP Yuki Chiba, Takahito Aoto, Yoshihito Toyama
2004	—	`conf`	Inductive Theorems for Higher-Order Rewriting. RTA Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
2003	—	`conf`	Termination of Simply Typed Term Rewriting by Translation and Labelling. RTA Takahito Aoto, Toshiyuki Yamada
2001	J	`jnl`	Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. J. Funct. Log. Program. Takahito Aoto
1999	J	`jnl`	On the Finite Model Property of Intuitionistic Modal Logics over MIPC. Math. Log. Q. Takahito Aoto, Hiroyuki Shirasu
1999	J	`jnl`	Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. J. Log. Lang. Inf. Takahito Aoto
1998	—	`conf`	Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. PLILP/ALP Takahito Aoto
1998	—	`conf`	Termination Transformation by Tree Lifting Ordering. RTA Takahito Aoto, Yoshihito Toyama
1997	—	`conf`	On Composable Properties of Term Rewriting Systems. ALP/HOA Takahito Aoto, Yoshihito Toyama
1997	J	`jnl`	Persistency of Confluence. J. Univers. Comput. Sci. Takahito Aoto, Yoshihito Toyama