Author： Rao M.R.K.K.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.241, Iss.1, 2000-06, pp. : 211-234
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Tracing Prolog programs by source instrumentation is efficient enough
The Journal of Logic Programming, Vol. 43, Iss. 2, 2000-05 ,pp. :
Access to resources
Recommend
Incremental learning of approximations from positive data
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
Intrinsic complexity of learning geometrical concepts from positive data
Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. :
Polynomial-time identification of very simple grammars from positive data
By Yokomori T.
Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. :
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :