WEKO3
アイテム
Research on Logic and Computation in Hypothesis Finding
https://ir.soken.ac.jp/records/2171
https://ir.soken.ac.jp/records/217167dc4f08-1eef-4c7b-8b4b-4fe615b0392e
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
要旨・審査要旨 (416.4 kB)
|
||
|
本文 (2.0 MB)
|
| Item type | 学位論文 / Thesis or Dissertation(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2011-06-03 | |||||
| タイトル | ||||||
| タイトル | Research on Logic and Computation in Hypothesis Finding | |||||
| タイトル | ||||||
| タイトル | Research on Logic and Computation in Hypothesis Finding | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_46ec | |||||
| 資源タイプ | thesis | |||||
| 著者名 |
山本, 泰生
× 山本, 泰生 |
|||||
| フリガナ |
ヤマモト, ヨシタカ
× ヤマモト, ヨシタカ |
|||||
| 著者 |
YAMAMOTO, Yoshitaka
× YAMAMOTO, Yoshitaka |
|||||
| 学位授与機関 | ||||||
| 学位授与機関名 | 総合研究大学院大学 | |||||
| 学位名 | ||||||
| 学位名 | 博士（情報学） | |||||
| 学位記番号 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | 総研大甲第1385号 | |||||
| 研究科 | ||||||
| 値 | 複合科学研究科 | |||||
| 専攻 | ||||||
| 値 | 17 情報学専攻 | |||||
| 学位授与年月日 | ||||||
| 学位授与年月日 | 2010-09-30 | |||||
| 学位授与年度 | ||||||
| 値 | 2010 | |||||
| 要旨 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | The thesis studies the logical mechanism and its computational proce- dures in hypothesis finding. Given a background theory and an observation that is not logically derived by the prior theory, we try to find a hypothesis that explains the observation with respect to the background theory. The hypothesis may contradict with a newly observed fact. That is why the logic in hypothesis finding is often regarded as ampliative inference. In first-order logic, the principle of inverse entailment (IE) has been ac- tively used to find hypotheses. Previously, many IE-based hypothesis finding systems have been proposed, and several of them are now being applied to practical problems in life sciences concerned with the study of living or- ganisms, like biology. However, these state-of-the-art systems have some fundamental limitation on hypothesis finding: They make the search space restricted due to computational efficiency. For the sake of incompleteness in hypothesis finding, there is an inherent possibility that they may fail to find such sufficient hypotheses that are worth examining. The thesis first provides such a practical problem, where those incomplete procedures cannot work well. In contrast, this motivating problem is solved by CF-induction, which is an IE-based procedure that enables us to find every hypothesis. On the other hand, complete procedures like CF-induction have to deal with a huge search space, and thus, are usually achieved by consisting of many non-deterministic procedures. The thesis next shows an alternative approach for finding hypotheses, which is based on the inverse relation of subsumption, instead of entailment. The proposed approach is used to simplify the IE-based procedures by reduc- ing their non-determinisms without losing completeness in hypothesis finding. Together with this result, we logically reconstruct the current procedure of CF-induction into a more simplified one, while it ensures the completeness. Through the thesis, we will see underlying nature and insights to overcome limitations in the current lE-based hypothesis finding procedures. |
|||||
| 所蔵 | ||||||
| 値 | 有 | |||||
| フォーマット | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | application/pdf | |||||
