Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Aoto, Takahito"'
Logically constrained term rewriting is a relatively new formalism where rules are equipped with constraints over some arbitrary theory. Although there are many recent advances with respect to rewriting induction, completion, complexity analysis and
Externí odkaz:
http://arxiv.org/abs/2405.01174
Autor:
Aoto, Takahito, Toyama, Yoshihito
The notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker than conf
Externí odkaz:
http://arxiv.org/abs/1807.00940
Autor:
Kajihara, Takehiro, Funatomi, Takuya, Makishima, Haruyuki, Aoto, Takahito, Kubo, Hiroyuki, Yamada, Shigehito, Mukaigawa, Yasuhiro
Publikováno v:
In Pattern Recognition December 2019 96
Autor:
Aoto, Takahito, Toyama, Yoshihito
Publikováno v:
Logical Methods in Computer Science, Volume 8, Issue 1 (March 28, 2012) lmcs:667
We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equat
Externí odkaz:
http://arxiv.org/abs/1203.5121
Autor:
Aoto, Takahito
Publikováno v:
Journal of Logic, Language, and Information, 1999 Apr 01. 8(2), 217-242.
Externí odkaz:
https://www.jstor.org/stable/40180198
Autor:
Kikuchi, Kentaro, Aoto, Takahito
A term rewriting system (TRS) is said to be sufficiently complete when each function yields some value for any input. Proof methods for sufficient completeness of terminating TRSs have been well studied. In this paper, we introduce a simple derivatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::760f9509a0329aa77c63c05090046f82
Autor:
Yamaguchi, Masaomi, Aoto, Takahito
Uniqueness of normal forms w.r.t. conversion (UNC) of term rewriting systems (TRSs) guarantees that there are no distinct convertible normal forms. It was recently shown that the UNC property of TRSs is decidable for shallow TRSs (Radcliffe et al., 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59ffbc04fa9425576769875e22253c5b
In (Aoto&Toyama, FSCD 2016), a method to prove ground confluence of many-sorted term rewriting systems based on rewriting induction is given. In this paper, we give several methods that add wider flexibility to the rewriting induction approach for pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::842327b6524895414bc84861745c549d
Autor:
Aoto, Takahito, Iwami, Munehiro
Publikováno v:
数理解析研究所講究録. 1915:161-165
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::cdc9bed1cee6105b06affad6d538bb33
http://hdl.handle.net/2433/223293
http://hdl.handle.net/2433/223293
Publikováno v:
IPSJ Transactions on Computer Vision & Applications; 4/7/2020, Vol. 12 Issue 1, p1-13, 13p