{"created":"2023-05-15T14:21:33.328683+00:00","id":3249,"links":{},"metadata":{"_buckets":{"deposit":"330d7835-77c6-4431-a2a4-22e4f3416da2"},"_deposit":{"created_by":3,"id":"3249","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3249"},"status":"published"},"_oai":{"id":"oai:bunkyo.repo.nii.ac.jp:00003249","sets":["1:26:231"]},"author_link":["4204"],"item_5_alternative_title_1":{"attribute_name":"タイトル カナ","attribute_value_mlt":[{"subitem_alternative_title":"イッパンカ ルイジド カンスウ オ モチイタ ドウシュツ ゲンリ ニ ヨル ダイ1カイ ジュツゴ スイロン"}]},"item_5_biblio_info_13":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-01-01","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"71","bibliographicPageStart":"27","bibliographicVolumeNumber":"27","bibliographic_titles":[{"bibliographic_title":"情報研究"},{"bibliographic_title":"Information and Communication Studies","bibliographic_titleLang":"en"}]}]},"item_5_description_12":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"　本論文での研究目的は,鈴木によってこれまで提案されている3システムRECOGNITRON,MEMOTRON,FUZZITRON以外に,パターン情報処理技術を基盤として,自然言語理解システムの構築に必要なテキスト推論機構を提案することである.本論文では,パターン情報処理におけるSS一般化類似度関数\n　　GSM:Φ×Φ→{slO≦s≦1}\nの働きで,つまり,GSM(Aφ,η)の値が2-1より大きいときパターン変換\n　　A:Φ→Φ\nに対応する第1階論理述語が近似的に真であるという\"fuzzy推論に似た解釈\"を採用し,テキスト推論技術を確保しようとする試みを展開する.ここに,Φ(∋φ,η)は処理の対象とするパターンφの集合である.このような試みは本研究以外に類を見ない.例えば,第1階述語論理の部分集合であるホーン節の集合(=Prologプログラム)を内部表現に用いて,\n　　ホーン節集合に対する推論がPrologプログラムの実行(閉世界での質問節についての,\n　　知識ベースからの証明過程)になる\nという事実に基づいて,自然言語処理を実現しようとする試みに直接,役立つ.\n\\n　An aim of this paper is to construct a text-inference mechanism needed to design a natural-understanding system based on pattern-information processing techniques except RECOGNITRON, MEMOTRON and FUZZITRON so far proposed by S.Suzuki. We explore to secure an inference-technique using texts, adopting an interpretation like a fuzzy inference that if a value GSM:(Aφ, η) of an generalized similar ity function\n　　GSM:Φ×Φ→{slO≦s≦1}\nis greater than 2-1, a predicate corresponding to a pattern-transformation\n　　A:Φ→Φ\nis approximately true, where Φ(∋φ,η) is a set consisting of patterns to be processed in question. There is not this trial until now. For example, we often uses as its internal knowledge expression a set of horn clauses(=Prolog program) according to the fact of that an inference for a Prolog horn clauses is equivalent to an execution of the clauses. A technique presented here is of any service to the trial which realizes a natural language prpocessing.","subitem_description_type":"Abstract"}]},"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_39":{"attribute_name":"本文言語","attribute_value_mlt":[{"subitem_text_value":"日本語"}]},"item_5_text_42":{"attribute_name":"ID","attribute_value_mlt":[{"subitem_text_value":"BKSJ270004"}]},"item_5_text_7":{"attribute_name":"Author","attribute_value_mlt":[{"subitem_text_value":"Suzuki, Shoichi"}]},"item_5_text_8":{"attribute_name":"所属機関","attribute_value_mlt":[{"subitem_text_value":"文教大学情報学部"}]},"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":"4204","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-03-24"}],"displaytype":"detail","filename":"BKSJ270004.pdf","filesize":[{"value":"2.5 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"BKSJ270004.pdf","url":"https://bunkyo.repo.nii.ac.jp/record/3249/files/BKSJ270004.pdf"},"version_id":"70496166-fd7e-4c26-9e45-ba3d1e9b3415"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"マルチメディア情報処理","subitem_subject_scheme":"Other"},{"subitem_subject":"自然言語理解システム","subitem_subject_scheme":"Other"},{"subitem_subject":"テキスト推論機構","subitem_subject_scheme":"Other"},{"subitem_subject":"パターン認識の数学的理論(SS理論)","subitem_subject_scheme":"Other"},{"subitem_subject":"モデル構成作用素","subitem_subject_scheme":"Other"},{"subitem_subject":"一般化類似度関数","subitem_subject_scheme":"Other"},{"subitem_subject":"一般化大分類関数","subitem_subject_scheme":"Other"},{"subitem_subject":"導出原理","subitem_subject_scheme":"Other"},{"subitem_subject":"命題","subitem_subject_scheme":"Other"},{"subitem_subject":"述語","subitem_subject_scheme":"Other"},{"subitem_subject":"第1階推論","subitem_subject_scheme":"Other"},{"subitem_subject":"人工知能言語","subitem_subject_scheme":"Other"},{"subitem_subject":"Prolog","subitem_subject_scheme":"Other"},{"subitem_subject":"パターン推論","subitem_subject_scheme":"Other"},{"subitem_subject":"記号推論","subitem_subject_scheme":"Other"}]},"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":"一般化類似度関数を用いた\"導出原理による第1階述語推論\"","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一般化類似度関数を用いた\"導出原理による第1階述語推論\""},{"subitem_title":"A First-Order Predicate-Logic Inference Using a Resolution Principle Based on Generalized Similarity-Measure Functions","subitem_title_language":"en"}]},"item_type_id":"5","owner":"3","path":["231"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-23"},"publish_date":"2011-02-23","publish_status":"0","recid":"3249","relation_version_is_last":true,"title":["一般化類似度関数を用いた\"導出原理による第1階述語推論\""],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2024-08-08T01:26:32.862153+00:00"}