WEKO3
アイテム
Model Inference Incorporating Generalization
https://ipsj.ixsq.nii.ac.jp/records/59802
https://ipsj.ixsq.nii.ac.jp/records/598023600e699-83ab-4eed-8faf-a9387b895594
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP1103006.pdf (736.2 kB)
|
Copyright (c) 1988 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1988-11-25 | |||||||
| タイトル | ||||||||
| タイトル | Model Inference Incorporating Generalization | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Model Inference Incorporating Generalization | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| IIAS-SIS. FUJITSU LIMITED | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| IIAS-SIS. FUJITSU LIMITED | ||||||||
| 著者名 |
Hiroki, Ishizaka
× Hiroki, Ishizaka
|
|||||||
| 著者名(英) |
Hiroki, Ishizaka
× Hiroki, Ishizaka
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper is concerned with a strategy for inductive inference of logic programs. In the strategy an inference machine infers the head of a program clause by the least generalization of positive facts. Hence the inference machine has only to enumerate the body of a program clause. This makes the inference machine efficient. However if the inference machine computes the least generalization of all positive facts it may occur that the atom becomes too general for the head of a program clause. In the strategy the main problem is to decide whether the least generalization of positive facts is too general or not. In this paper we shall formulate this problem and discuss its decidability. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper is concerned with a strategy for inductive inference of logic programs. In the strategy an inference machine infers the head of a program clause by the least generalization of positive facts. Hence, the inference machine has only to enumerate the body of a program clause. This makes the inference machine efficient. However, if the inference machine computes the least generalization of all positive facts, it may occur that the atom becomes too general for the head of a program clause. In the strategy the main problem is to decide whether the least generalization of positive facts is too general or not. In this paper we shall formulate this problem and discuss its decidability. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 11, 号 3, p. 206-211, 発行日 1988-11-25 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
