Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Masahiko, Sakai"'
Publikováno v:
Beilstein Journal of Organic Chemistry, Vol 16, Iss 1, Pp 409-414 (2020)
We have developed a catalytic synthetic method to prepare phenoxasilins. A borane-catalyzed double sila-Friedel–Crafts reaction between amino group-containing diaryl ethers and dihydrosilanes can be used to prepare a variety of phenoxasilin derivat
Externí odkaz:
https://doaj.org/article/9c1b8bbb71c143a3877f5fbcd4ea59d1
Autor:
Yutaro Nagae, Masahiko Sakai
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 265, Iss Proc. WPTE 2017, Pp 67-81 (2018)
A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regarded as a declarative program defining predicates, where a program exec
Externí odkaz:
https://doaj.org/article/9db8f21a18da48159c6e1faea9e5f128
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 265, Iss Proc. WPTE 2017, Pp 82-97 (2018)
In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success of provin
Externí odkaz:
https://doaj.org/article/d849c95ecd554e3491f440b29c45fd2b
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 235, Iss Proc. WPTE 2016, Pp 62-77 (2017)
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. Mor
Externí odkaz:
https://doaj.org/article/8104beac9d6149c8a2536b315fbaf372
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 235, Iss Proc. WPTE 2016, Pp 46-61 (2017)
A parameterised Boolean equation system (PBES) is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded as a declarative program defining functions that take a datum and ret
Externí odkaz:
https://doaj.org/article/6ef8cff1117943318201673141d10dd9
Autor:
Masahiko Sakai
Publikováno v:
The Journal of The Institute of Electrical Engineers of Japan. 141:89-92
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 134, Iss Proc. TTATT 2013, Pp 1-10 (2013)
An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of constraine
Externí odkaz:
https://doaj.org/article/25fa60ed8658431688b19cde85019fd6
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 30:349-360
This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances o
Autor:
Chihiro HATTA, Toshihiko SHIMIZU, Masayoshi OZAWA, Masahiko SAKAI, Tadahiro OYAMA, Samuel Amar Julien, Shuhei IKEMOTO
Publikováno v:
The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec). 2022:1P1-C06
Autor:
Tsubasa HAMADA, Toshihiko SHIMIZU, Masayoshi OZAWA, Masahiko SAKAI, Tadahiro OYAMA, AMAR Julien Samuel, Shuhei IKEMOTO
Publikováno v:
The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec). 2022:2A1-P07