A class of Prolog programs inferable from positive data

Krishna Rao, M. R. K.

doi:10.1007/3-540-61863-5_52

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

A class of Prolog programs inferable from positive data

MPS-Authors

/persons/resource/persons44846

Krishna Rao, M. R. K.
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dt9CH
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Krishna Rao, M. R. K. (1996). A class of Prolog programs inferable from positive data. In S., Arikawa, & A., Sharma (Eds.), Algorithmic Learning Theory (pp. 272-284). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ABBF-0

要旨

In this paper, we identify a class of Prolog programs
inferable from positive data. Our approach is based
on moding information and linear predicate inequalities
between input terms and output terms. Our results generalize
the results of Arimura and Shinohara (1994).
Standard programs for {\tt reverse, quick-sort, merge-sort}
are a few examples of programs that can be handled by our results but
not by the earlier results of Arimura and Shinohara (1994). The generality
of
our results follows from the fact that we treat logical variables
as transmitters for broadcasting communication, whereas
Arimura and Shinohara (1994) treat them as point-to-point
communication channels.