Inductive inference of term rewriting systems from positive data

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3244, Issue , 2004, Pages 69-82

  Krishna Rao, M R K ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; FORMAL LANGUAGES; ITERATIVE METHODS; PATTERN RECOGNITION; PROLOG (PROGRAMMING LANGUAGE); SET THEORY; THEOREM PROVING; COMPUTATIONAL MECHANICS; INPUT OUTPUT PROGRAMS;

INDUCTIVE INFERENCE; PATTERN LANGUAGES; SEMANTIC MAPPING; TERM REWRITTING SYSTEMS (TRS);

INFERENCE ENGINES; PROLOG (PROGRAMMING LANGUAGE);

INDUCTIVE INFERENCE; POSITIVE DATA; POSITIVE EXAMPLES; PROLOG PROGRAMS; RIGHT-HAND SIDES; TERM REWRITING SYSTEMS;

EID: 22944443592     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. D. Angluin (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117-135.
2. H. Arimura, T. Shinohara and S. Otsuki (1994), Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data, Proc. of STACS'94, LNCS 775, pp. 649-660.
3. H. Arimura and T. Shinohara (1994), Inductive inference of Prolog programs with linear data dependency from positive data, Proc. Information Modelling and Knowledge Bases V, pp. 365-375, IOS press.
4. L. Blum and M. Blum (1975), Towards a mathematical theory of inductive inference, Information, and Control 28, pp. 125-155.
5. N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243-320, North-Holland.
6. E.M. Gold (1967), Language identification in the limit, Information and Control 10, pp. 447-474.
7. J.W. Klop (1992), Term Rewriting Systems, in S. Abramsky, D. Gabby and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 1, Oxford Press, 1992.
8. M. R. K. Krishna Rao (2000), Some classes of prolog programs inferable from positive data, Theor. Comput. Sci. 241, pp. 211-234.
9. Y. Mukouchi, I.Yamaue, M. Sato (1998), Inferring a Rewriting System from Examples, Proc. of DS'98, LNCS 1532, pp. 93-104
10. T. Shinohara (1991), Inductive inference of monotonie formal systems from positive data, New Generation Computing 8, pp. 371-384.
11. Takeshi Shinohara, Hiroki Arimura (2000), Inductive inference of unbounded unions of pattern languages from positive data, Theor. Comput. Sci. 241, pp. 191-209.