A class of prolog programs inferable from positive data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1160, Issue , 1996, Pages 272-284

  Krishna Rao, M R K ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SORTING;

BROADCASTING COMMUNICATION; LOGICAL VARIABLES; POINT-TO-POINT COMMUNICATION CHANNELS; POSITIVE DATA; PROLOG PROGRAMS; QUICK SORTS; SHINOHARA;

PROLOG (PROGRAMMING LANGUAGE);

EID: 21444443683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61863-5_52     Document Type: Conference Paper

References (12)

1. D. Angluin (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117-135.
2. K.R. Apt and D. Pedreschi (1993), Reasoning about termination of pure Prolog programs, Information and Computation 106, pp. 109-157.
3. H. Arimura (1993), Depth-bounded inference for nonterminating Prologs, Bulletin of Informatics and Cybernetics 25, pp. 125-136.
4. 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.
5. E.M. Gold (1967), Language identification in the limit, Information and Control 10, pp. 447-474.
6. J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.
7. S. Muggleton and L. De Raedt (1994), Inductive logic programming: theory and methods, J. Logic Prog. 19/20, pp. 629-679.
8. L. Pliimer(1990), Termination proofs for logic programs, Ph.D. thesis, University of Dortmund, Also appears as Lecture Notes in Computer Science 446, Springer- Verlag.
9. E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ.
10. E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.
11. T. Shinohara (1991), Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, pp. 371-384.
12. J.D. Ullman and A. van Gelder (1988), Efficient tests for top-Down termination of logical rules, JACM 35, pp. 345-373.