2026-03-15T05:47:47Z https://bunkyo.repo.nii.ac.jp/oai

oai:bunkyo.repo.nii.ac.jp:00003363 2024-08-08T01:03:30Z 1:26:194

サイハン アトム オ モチイナイ セイミツカ ホウホウ ニ ヨル Prolog プログラム ノ キノウテキ ジドウ ゴウセイ システム ノ Cゲンゴ ニ ヨル ジツゲン ジョウホウガク キョウドウ ケンキュウ 最汎アトムを用いない精密化方法によるPrologプログラムの帰納的自動合成システムの,C言語による実現(情報学共同研究) A Technique for Prolog Program Synthesis by Doing without Most General Atoms 鈴木, 昇一 中村, 三郎 E.Y. Shapiro proved that any Prolog-program is constructed by means of an iteration of the following four operations: (1) An addition of an atom to a head of a Horn clause (2) A unification of two variables (3) A unification of a variable and a function (4) An addition of the most general agom to a body. It is indeterminate to obtain the most general atom needed in the operation (4). Therefore in this investigation the inductive model-inference algorithm proposed by Shapiro has been implemented with C-language without using the most general atom. It is easy to control the program-synthesis in this method, but a space of hypotheses increases explosively in the size. We shall show that the contradiction-backtracing is reduced to the inverse application?order of the resolution principle. departmental bulletin paper 文教大学 1989-01-01 VoR application/pdf 情報研究 10 151 167 Information and Communication Studies 03893367 https://bunkyo.repo.nii.ac.jp/record/3363/files/BKSJ100013.pdf https://bunkyo.repo.nii.ac.jp/records/3363 jpn