{"created":"2023-06-20T13:21:52.338563+00:00","id":2171,"links":{},"metadata":{"_buckets":{"deposit":"db90bb4c-2674-4898-9107-109cc78e5c2c"},"_deposit":{"created_by":21,"id":"2171","owners":[21],"pid":{"revision_id":0,"type":"depid","value":"2171"},"status":"published"},"_oai":{"id":"oai:ir.soken.ac.jp:00002171","sets":["2:429:19"]},"author_link":["0","0","0"],"item_1_creator_2":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山本, 泰生"}],"nameIdentifiers":[{}]}]},"item_1_creator_3":{"attribute_name":"フリガナ","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"ヤマモト, ヨシタカ"}],"nameIdentifiers":[{}]}]},"item_1_date_granted_11":{"attribute_name":"学位授与年月日","attribute_value_mlt":[{"subitem_dategranted":"2010-09-30"}]},"item_1_degree_grantor_5":{"attribute_name":"学位授与機関","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_name":"総合研究大学院大学"}]}]},"item_1_degree_name_6":{"attribute_name":"学位名","attribute_value_mlt":[{"subitem_degreename":"博士（情報学）"}]},"item_1_description_12":{"attribute_name":"要旨","attribute_value_mlt":[{"subitem_description":"　　The thesis studies the logical mechanism and its computational proce-\r\ndures in hypothesis finding. Given a background theory and an observation\r\nthat is not logically derived by the prior theory, we try to find a hypothesis\r\nthat explains the observation with respect to the background theory. The\r\nhypothesis may contradict with a newly observed fact. That is why the logic\r\nin hypothesis finding is often regarded as ampliative inference.\r\n　In first-order logic, the principle of inverse entailment (IE) has been ac-\r\ntively used to find hypotheses. Previously, many IE-based hypothesis finding\r\nsystems have been proposed, and several of them are now being applied to\r\npractical problems in life sciences concerned with the study of living or-\r\nganisms, like biology. However, these state-of-the-art systems have some\r\nfundamental limitation on hypothesis finding: They make the search space\r\nrestricted due to computational efficiency. For the sake of incompleteness in\r\nhypothesis finding, there is an inherent possibility that they may fail to find\r\nsuch sufficient hypotheses that are worth examining.\r\n　　The thesis first provides such a practical problem, where those incomplete\r\nprocedures cannot work well. In contrast, this motivating problem is solved\r\nby CF-induction, which is an IE-based procedure that enables us to find\r\nevery hypothesis. On the other hand, complete procedures like CF-induction\r\nhave to deal with a huge search space, and thus, are usually achieved by\r\nconsisting of many non-deterministic procedures.\r\n　　The thesis next shows an alternative approach for finding hypotheses,\r\nwhich is based on the inverse relation of subsumption, instead of entailment.\r\nThe proposed approach is used to simplify the IE-based procedures by reduc-\r\ning their non-determinisms without losing completeness in hypothesis finding.\r\nTogether with this result, we logically reconstruct the current procedure of\r\nCF-induction into a more simplified one, while it ensures the completeness.\r\nThrough the thesis, we will see underlying nature and insights to overcome\r\nlimitations in the current lE-based hypothesis finding procedures.","subitem_description_type":"Other"}]},"item_1_description_18":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_1_description_7":{"attribute_name":"学位記番号","attribute_value_mlt":[{"subitem_description":"総研大甲第1385号","subitem_description_type":"Other"}]},"item_1_select_14":{"attribute_name":"所蔵","attribute_value_mlt":[{"subitem_select_item":"有"}]},"item_1_select_8":{"attribute_name":"研究科","attribute_value_mlt":[{"subitem_select_item":"複合科学研究科"}]},"item_1_select_9":{"attribute_name":"専攻","attribute_value_mlt":[{"subitem_select_item":"17 情報学専攻"}]},"item_1_text_10":{"attribute_name":"学位授与年度","attribute_value_mlt":[{"subitem_text_value":"2010"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"YAMAMOTO, Yoshitaka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-17"}],"displaytype":"simple","filename":"甲1385_要旨.pdf","filesize":[{"value":"416.4 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"要旨・審査要旨","url":"https://ir.soken.ac.jp/record/2171/files/甲1385_要旨.pdf"},"version_id":"450ac653-7474-4f87-8113-01c4416f561a"},{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-17"}],"displaytype":"simple","filename":"甲1385_本文.pdf","filesize":[{"value":"2.0 MB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"本文","url":"https://ir.soken.ac.jp/record/2171/files/甲1385_本文.pdf"},"version_id":"adb89bb5-4e5e-4de9-84d5-1deae3154a1e"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"thesis","resourceuri":"http://purl.org/coar/resource_type/c_46ec"}]},"item_title":"Research on Logic and Computation in Hypothesis Finding","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Research on Logic and Computation in Hypothesis Finding"},{"subitem_title":"Research on Logic and Computation in Hypothesis Finding","subitem_title_language":"en"}]},"item_type_id":"1","owner":"21","path":["19"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-06-03"},"publish_date":"2011-06-03","publish_status":"0","recid":"2171","relation_version_is_last":true,"title":["Research on Logic and Computation in Hypothesis Finding"],"weko_creator_id":"21","weko_shared_id":-1},"updated":"2023-06-20T15:54:59.559130+00:00"}