WEKO3
アイテム
One Inference Mechanism based on Automated Theorem Proving
http://hdl.handle.net/10098/3819
http://hdl.handle.net/10098/3819c1aecd2b-4f50-437f-ab58-6b10a7480e0e
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
AN00215401-034-01-013.pdf (600.4 kB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2011-08-31 | |||||||||
| タイトル | ||||||||||
| タイトル | One Inference Mechanism based on Automated Theorem Proving | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | departmental bulletin paper | |||||||||
| 著者 |
WATANABE, Katsumasa
× WATANABE, Katsumasa
× TSUJI, Tatsuo
|
|||||||||
| 抄録 | ||||||||||
| 内容記述タイプ | Abstract | |||||||||
| 内容記述 | To combine the logic programming system and the conventional procedural programming system, we intend to introduce the production rules as a data type in Pascal. Then, the compiler system should have the ability to accept this type of data and the inference mechanism to respond the questions in the program. As a method of inferences, we pick out one method of automated theorem proving. In this paper, we describe how to prove the theorems in propositional logic and predicate logic, and to apply the method to the inference mechanism. We propose to transform the rules given as data into internal form to perform inference efficiently, and denote the role of rule-compiler. | |||||||||
| 書誌情報 |
福井大学工学部研究報告 巻 34, 号 1, p. 139-153, 発行日 1986-03 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 4298373 | |||||||||
| 書誌レコードID | ||||||||||
| 識別子タイプ | NCID | |||||||||
| 関連識別子 | TD00004258 | |||||||||
