WEKO3
インデックスリンク
アイテム
{"_buckets": {"deposit": "f447c6f6-ad81-48a6-914e-61a2f74e70f8"}, "_deposit": {"created_by": 3, "id": "3363", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "3363"}, "status": "published"}, "_oai": {"id": "oai:bunkyo.repo.nii.ac.jp:00003363", "sets": ["194"]}, "author_link": ["4335", "4336"], "item_5_alternative_title_1": {"attribute_name": "タイトル カナ", "attribute_value_mlt": [{"subitem_alternative_title": "サイハン アトム オ モチイナイ セイミツカ ホウホウ ニ ヨル Prolog プログラム ノ キノウテキ ジドウ ゴウセイ システム ノ Cゲンゴ ニ ヨル ジツゲン ジョウホウガク キョウドウ ケンキュウ"}]}, "item_5_biblio_info_13": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1989-01-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "167", "bibliographicPageStart": "151", "bibliographicVolumeNumber": "10", "bibliographic_titles": [{"bibliographic_title": "情報研究"}, {"bibliographic_title": "Information and Communication Studies", "bibliographic_titleLang": "en"}]}]}, "item_5_date_43": {"attribute_name": "作成日", "attribute_value_mlt": [{"subitem_date_issued_datetime": "2012-01-17", "subitem_date_issued_type": "Created"}]}, "item_5_description_12": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": " E.Y. Shapiro proved that any Prolog-program is constructed by means of an iteration of the following four operations:\n(1) An addition of an atom to a head of a Horn clause\n(2) A unification of two variables (3) A unification of a variable and a function (4) An addition of the most general agom to a body.\nIt is indeterminate to obtain the most general atom needed in the operation (4). Therefore in this investigation the inductive model-inference algorithm proposed by Shapiro has been implemented with C-language without using the most general atom. It is easy to control the program-synthesis in this method, but a space of hypotheses increases explosively in the size. We shall show that the contradiction-backtracing is reduced to the inverse application?order of the resolution principle.", "subitem_description_type": "Abstract"}]}, "item_5_description_34": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_description": "text", "subitem_description_type": "Other"}]}, "item_5_description_38": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_5_publisher_16": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "文教大学"}]}, "item_5_source_id_19": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "03893367", "subitem_source_identifier_type": "ISSN"}]}, "item_5_text_14": {"attribute_name": "出版年", "attribute_value_mlt": [{"subitem_text_value": "1989"}]}, "item_5_text_15": {"attribute_name": "出版地", "attribute_value_mlt": [{"subitem_text_value": "神奈川県茅ヶ崎市"}]}, "item_5_text_17": {"attribute_name": "出版社 カナ", "attribute_value_mlt": [{"subitem_text_value": "ブンキョウ ダイガク"}]}, "item_5_text_18": {"attribute_name": "Publisher", "attribute_value_mlt": [{"subitem_text_value": "Bunkyo University"}]}, "item_5_text_39": {"attribute_name": "本文言語", "attribute_value_mlt": [{"subitem_text_value": "日本語"}]}, "item_5_text_42": {"attribute_name": "ID", "attribute_value_mlt": [{"subitem_text_value": "BKSJ100013"}]}, "item_5_text_46": {"attribute_name": "記録日", "attribute_value_mlt": [{"subitem_text_value": "2012/1/17"}]}, "item_5_text_47": {"attribute_name": "最終更新日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "2012/1/20"}]}, "item_5_text_48": {"attribute_name": "更新履歴(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Jan 20, 2012 インデックス, 抄録 を変更"}]}, "item_5_text_49": {"attribute_name": "登録者(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "bunkyo2"}]}, "item_5_text_50": {"attribute_name": "閲覧数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "350"}]}, "item_5_text_51": {"attribute_name": "ダウンロード数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "391"}]}, "item_5_text_7": {"attribute_name": "Author", "attribute_value_mlt": [{"subitem_text_value": "Suzuki, Shoichi"}, {"subitem_text_value": "Nakamura, Saburo"}]}, "item_5_text_8": {"attribute_name": "所属機関", "attribute_value_mlt": [{"subitem_text_value": "文教大学情報学部"}, {"subitem_text_value": "株式会社インターナショナルソフトウェア"}]}, "item_5_text_9": {"attribute_name": "Institution", "attribute_value_mlt": [{"subitem_text_value": "Bunkyo University, School of Information and Communication"}]}, "item_5_version_type_35": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "鈴木, 昇一"}], "nameIdentifiers": [{"nameIdentifier": "4335", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "中村, 三郎"}], "nameIdentifiers": [{"nameIdentifier": "4336", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-03-24"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "BKSJ100013.pdf", "filesize": [{"value": "1.2 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1200000.0, "url": {"label": "BKSJ100013.pdf", "url": "https://bunkyo.repo.nii.ac.jp/record/3363/files/BKSJ100013.pdf"}, "version_id": "e7e9717f-ba0c-4c62-9fe4-08106f7df2d4"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究)", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究)"}, {"subitem_title": "A Technique for Prolog Program Synthesis by Doing without Most General Atoms", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "3", "path": ["194"], "permalink_uri": "https://bunkyo.repo.nii.ac.jp/records/3363", "pubdate": {"attribute_name": "公開日", "attribute_value": "2012-01-17"}, "publish_date": "2012-01-17", "publish_status": "0", "recid": "3363", "relation": {}, "relation_version_is_last": true, "title": ["最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究)"], "weko_shared_id": -1}
最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究)
https://bunkyo.repo.nii.ac.jp/records/3363
https://bunkyo.repo.nii.ac.jp/records/33633bd9bdf4-bbb9-4656-9a34-7456eb60b35e
名前 / ファイル | ライセンス | アクション |
---|---|---|
BKSJ100013.pdf (1.2 MB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2012-01-17 | |||||
タイトル | ||||||
タイトル | 最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究) | |||||
タイトル | ||||||
タイトル | A Technique for Prolog Program Synthesis by Doing without Most General Atoms | |||||
言語 | ||||||
言語 | jpn | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
著者 |
鈴木, 昇一
× 鈴木, 昇一× 中村, 三郎 |
|||||
著者 | ||||||
Suzuki, Shoichi | ||||||
著者 | ||||||
Nakamura, Saburo | ||||||
所属機関 | ||||||
文教大学情報学部 | ||||||
所属機関 | ||||||
株式会社インターナショナルソフトウェア | ||||||
所属機関 | ||||||
Bunkyo University, School of Information and Communication | ||||||
内容記述 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | E.Y. Shapiro proved that any Prolog-program is constructed by means of an iteration of the following four operations: (1) An addition of an atom to a head of a Horn clause (2) A unification of two variables (3) A unification of a variable and a function (4) An addition of the most general agom to a body. It is indeterminate to obtain the most general atom needed in the operation (4). Therefore in this investigation the inductive model-inference algorithm proposed by Shapiro has been implemented with C-language without using the most general atom. It is easy to control the program-synthesis in this method, but a space of hypotheses increases explosively in the size. We shall show that the contradiction-backtracing is reduced to the inverse application?order of the resolution principle. |
|||||
書誌情報 |
情報研究 en : Information and Communication Studies 巻 10, p. 151-167, 発行日 1989-01-01 |
|||||
ISSN | ||||||
収録物識別子 | 03893367 | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
本文言語 | ||||||
日本語 | ||||||
ID | ||||||
BKSJ100013 | ||||||
作成日 | ||||||
日付 | 2012-01-17 |