default search action
Takahito Aoto 0001
Person information
- affiliation: Niigata University, Japan
Other persons with the same name
- Takahito Aoto 0002
— University of Tsukuba, Japan (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c39]Takahito Aoto, Naoki Nishida, Jonas Schöpf
Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD 2024: 31:1-31:21 - [c38]Takahito Aoto
Proving Uniqueness of Normal Forms w.r.t Reduction of Term Rewriting Systems. LOPSTR 2024: 185-201 - [i2]Takahito Aoto, Naoki Nishida, Jonas Schöpf:
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version). CoRR abs/2405.01174 (2024) - 2023
- [c37]Ryota Haga, Yuki Kagaya, Takahito Aoto
A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems. FroCoS 2023: 99-116 - 2021
- [c36]Kentaro Kikuchi, Takahito Aoto:
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. FSTTCS 2021: 49:1-49:15 - [c35]Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto:
A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. ICTAC 2021: 386-404 - [c34]Mamoru Ishizuka, Takahito Aoto
Commutative Rational Term Rewriting. LATA 2021: 200-212 - 2020
- [c33]Masaomi Yamaguchi
A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems. FSCD 2020: 11:1-11:23 - [c32]Kentaro Kikuchi, Takahito Aoto:
Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables. LOPSTR 2020: 56-73
2010 – 2019
- 2019
- [c31]Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. FroCos 2019: 330-347 - [c30]Kentaro Kikuchi, Takahito Aoto, Isao Sasano:
Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation. PPDP 2019: 13:1-13:14 - 2018
- [c29]Takahito Aoto, Makoto Hamana, Nao Hirokawa
Confluence Competition 2018. FSCD 2018: 32:1-32:5 - [i1]Takahito Aoto, Yoshihito Toyama:
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems. CoRR abs/1807.00940 (2018) - 2017
- [c28]Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. FroCoS 2017: 115-131 - [c27]Takahito Aoto, Yoshihito Toyama, Yuta Kimura:
Improving Rewriting Induction Approach for Proving Ground Confluence. FSCD 2017: 7:1-7:18 - 2016
- [c26]Takahito Aoto, Kentaro Kikuchi:
Nominal Confluence Tool. IJCAR 2016: 173-182 - [c25]Takahito Aoto, Yoshihito Toyama:
Ground Confluence Prover based on Rewriting Induction. FSCD 2016: 33:1-33:12 - [c24]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Critical Pair Analysis in Nominal Rewriting. SCSS 2016: 156-168 - 2015
- [c23]Takahito Aoto, Nao Hirokawa
Confluence Competition 2015. CADE 2015: 101-104 - [c22]Koichi Sato, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Correctness of Context-Moving Transformations for Term Rewriting Systems. LOPSTR 2015: 331-345 - [c21]Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Confluence of Orthogonal Nominal Rewriting Systems Revisited. RTA 2015: 301-317 - 2014
- [c20]Takahito Aoto, Sorin Stratulat:
Decision Procedures for Proving Inductive Theorems without Induction. PPDP 2014: 237-248 - [c19]Takahito Aoto, Yoshihito Toyama, Kazumasa Uchida:
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams. RTA-TLCA 2014: 46-60 - 2013
- [c18]Takahito Aoto:
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering. FroCos 2013: 311-326 - [c17]Takahito Aoto, Munehiro Iwami:
Termination of Rule-Based Calculi for Uniform Semi-Unification. LATA 2013: 56-67 - 2012
- [j10]Takahito Aoto, Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. Log. Methods Comput. Sci. 8(1) (2012) - [j9]Takahito Aoto, Aart Middeldorp:
Preface. Theor. Comput. Sci. 464: 1-2 (2012) - [c16]Takahito Aoto, Jeroen Ketema:
Rational Term Rewriting Revisited: Decidability and Confluence. ICGT 2012: 172-186 - 2011
- [c15]Takahito Aoto, Yoshihito Toyama:
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. RTA 2011: 91-106 - [c14]Takahito Aoto, Toshiyuki Yamada, Yuki Chiba:
Natural Inductive Theorems for Higher-Order Rewriting. RTA 2011: 107-121 - 2010
- [j8]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program Transformation Templates for Tupling Based on Term Rewriting. IEICE Trans. Inf. Syst. 93-D(5): 963-973 (2010) - [c13]Takahito Aoto:
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling. RTA 2010: 7-16
2000 – 2009
- 2009
- [c12]Takahito Aoto, Toshiyuki Yamada:
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs. FroCoS 2009: 117-132 - [c11]Takahito Aoto, Junichi Yoshida, Yoshihito Toyama:
Proving Confluence of Term Rewriting Systems Automatically. RTA 2009: 93-102 - 2008
- [j7]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Automatic Construction of Program Transformation Templates. Inf. Media Technol. 3(2): 211-224 (2008) - [j6]Takahito Aoto:
Soundness of Rewriting Induction Based on an Abstract Principle. Inf. Media Technol. 3(2): 225-235 (2008) - [c10]Takahito Aoto:
Sound Lemma Generation for Proving Inductive Validity of Equations. FSTTCS 2008: 13-24 - 2007
- [j5]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program Transformation by Templates: A Rewriting Framework. Inf. Media Technol. 2(1): 53-67 (2007) - 2006
- [c9]Takahito Aoto:
Dealing with Non-orientable Equations in Rewriting Induction. RTA 2006: 242-256 - [c8]Yuki Chiba, Takahito Aoto:
RAPT: A Program Transformation System Based on Term Rewriting. RTA 2006: 267-276 - 2005
- [c7]Yuki Chiba, Takahito Aoto, Yoshihito Toyama:
Program transformation by templates based on term rewriting. PPDP 2005: 59-69 - [c6]Takahito Aoto, Toshiyuki Yamada:
Dependency Pairs for Simply Typed Term Rewriting. RTA 2005: 120-134 - 2004
- [c5]Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama:
Inductive Theorems for Higher-Order Rewriting. RTA 2004: 269-284 - 2003
- [c4]Takahito Aoto, Toshiyuki Yamada:
Termination of Simply Typed Term Rewriting by Translation and Labelling. RTA 2003: 380-394 - 2001
- [j4]Takahito Aoto:
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. J. Funct. Log. Program. 2001(11) (2001)
1990 – 1999
- 1999
- [j3]Takahito Aoto:
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. J. Log. Lang. Inf. 8(2): 217-242 (1999) - [j2]Takahito Aoto, Hiroyuki Shirasu:
On the Finite Model Property of Intuitionistic Modal Logics over MIPC. Math. Log. Q. 45: 435-448 (1999) - 1998
- [c3]Takahito Aoto:
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. PLILP/ALP 1998: 250-265 - [c2]Takahito Aoto, Yoshihito Toyama:
Termination Transformation by Tree Lifting Ordering. RTA 1998: 256-270 - 1997
- [j1]Takahito Aoto, Yoshihito Toyama:
Persistency of Confluence. J. Univers. Comput. Sci. 3(11): 1134-1147 (1997) - [c1]Takahito Aoto, Yoshihito Toyama:
On Composable Properties of Term Rewriting Systems. ALP/HOA 1997: 114-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: