WEKO3
アイテム
THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS
https://kitami-it.repo.nii.ac.jp/records/7951
https://kitami-it.repo.nii.ac.jp/records/79513bddc8d2-85e3-4bd9-a2a0-7f8bc4118b5b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
2013.06_Theoretical Basis for making Equivalent Transformation Rules from Logical Equivalences for Program Synthesis.pdf (229.5 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2015-09-03 | |||||
| タイトル | ||||||
| タイトル | THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | Equivalent transformation (ET) rule | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | Logical equivalence (LE) | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | Equivalence relationship of clause sets | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | Rule generation mapping (RGM) | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | LE in Class S | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| 著者 |
Miura, Katsunori
× Miura, Katsunori× Akama, Kiyoshi× Mabuchi, Hiroshi× Koike, Hidekatsu |
|||||
| 著者別名 | ||||||
| 識別子Scheme | WEKO | |||||
| 識別子 | 44889 | |||||
| 識別子Scheme | KAKEN | |||||
| 識別子URI | https://nrid.nii.ac.jp/ja/nrid/1000050636587 | |||||
| 識別子 | 50636587 | |||||
| 姓名 | 三浦, 克宜 | |||||
| 言語 | ja | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | To propose methods for making Equivalent Transformation (ET) rules is important for generating correct and sufficiently efficient programs from a speci cation which is a set of logical formulas. An ET rule is a procedure for replacing a clause set with another one while preserving declarative meaning. This paper proposes a new method for making ET rules via a Logical Equivalence (LE) from a speci cation. An LE describes an equivalence relationship between two logical formulas under some speci ed preconditions. We newly formulate an LE and de ne the correctness of LEs with respect to a speci cation. It is guaranteed by the method of this paper that an ET rule can be made from a correct LE. The method is useful for the generation of various programs. Many ET rules included in programs which solve constraint satisfaction problems, can be made by the method. |
|||||
| 書誌情報 |
en : International Journal of Innovative Computing, Information and Control 巻 9, 号 6, p. 2635-2650, 発行日 2013-06 |
|||||
| 権利 | ||||||
| 権利情報 | c 2013 ICIC International | |||||
| 出版者 | ||||||
| 出版者 | ICIC International | |||||
| 関連サイト | ||||||
| URL | http://www.ijicic.org/contents.htm | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 出版タイプ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
