English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

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
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABBF-0
Abstract
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.