Zobrazeno 1 - 10 of 94 pro vyhledávání: '"KUSAKARI Keiichirou"'
2
Report
Nagoya Termination Tool
Autor: Yamada, Akihisa, Kusakari, Keiichirou, Sakabe, Toshiki
This paper describes the implementation and techniques of the Nagoya Termination Tool, a termination prover for term rewrite systems. The main features of the tool are: the first implementation of the weighted path order which subsumes most of the ex
Externí odkaz: http://arxiv.org/abs/1404.6626
Zobrazit plný text záznamu
3
Report
A Unified Ordering for Termination Proving
Autor: Yamada, Akihisa, Kusakari, Keiichirou, Sakabe, Toshiki
We introduce a reduction order called the weighted path order (WPO) that subsumes many existing reduction orders. WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by a wide class of interpretat
Externí odkaz: http://arxiv.org/abs/1404.6245
Zobrazit plný text záznamu
4
Report
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Autor: Kusakari, Keiichirou, Isogai, Yasuo, Sakai, Masahiko, Blanqui, Frédéric
Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of
Externí odkaz: http://arxiv.org/abs/1109.5468
Zobrazit plný text záznamu
5
Report
Argument filterings and usable rules in higher-order rewrite systems
Autor: Suzuki, Sho, Kusakari, Keiichirou, Blanqui, Frédéric
Publikováno v: IPSJ Transactions on Programming 4, 2 (2011) 1-12
The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduce
Externí odkaz: http://arxiv.org/abs/1109.4357
Zobrazit plný text záznamu
7
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
8
Malbolge with 20trits word length and its programming
Autor: KATO, Tatsuki, SAKAI, Masahiko, SAKABE, Toshiki, KUSAKARI, Keiichirou, NISHIDA, Naoki
Publikováno v: 電子情報通信学会技術研究報告. KBSE, 知能ソフトウェア工学. 113(160):73-78
Malbolgeは最も難解なプログラミング言語として知られている.近年,Malbolgeのための中間言語として低級アセンブリ言語が設計され,そのプログラムからMalbolgeプログラムを生成する低級アセ
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::9800833713dc0d1d6d51bafe6e906887
https://nagoya.repo.nii.ac.jp/records/21421
Zobrazit plný text záznamu
9
On Composing the Simplex Method and Gomory Cut for Deriving Integer Assignments
Autor: FUSHIMI, Masaaki, NISHIDA, Naoki, SAKAI, Masahiko, KUSAKARI, Keiichirou, SAKABE, Toshiki
Publikováno v: 電子情報通信学会技術研究報告. MSS, システム数理と応用. 112(457):109-114
与えられた有理数上の線形制約を充足する割り当てを求める手法として単体法がある.また,有理数解を求める手法と,ゴモリーカットをはじめとする切除平面法を組み合わせることで整数
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::66c0954beb4e34e7b3be80c6fc903167
https://nagoya.repo.nii.ac.jp/records/21420
Zobrazit plný text záznamu
10
制約付き項のインスタンスを受理する制約付き木オートマトンの構成法
Autor: NAKANO, Yasuhiro, NISHIDA, Naoki, SAKAI, Masahiko, SAKABE, Toshiki, KUSAKARI, Keiichirou
Publikováno v: 電子情報通信学会技術研究報告. SS, ソフトウェアサイエンス. 112(373):7-12
制約付き項書換え系の書換え帰納法に基づいた定理自動証明の際に、制約付き項書換え系のR完全性の判定手続きが必要である。また、対象の制約付き項書換え系が十分完全性を持つ場合
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::639c461a8b29fbbd606eeb331c31db01
https://nagoya.repo.nii.ac.jp/records/21419
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje