1Bergman M., Kanoui H., (1973), Application of Mechanical Theorem Proving to Symbolic Calculus. Third International Symposium on Advanced Computing Methods in Theoretical Physics, C.N.R.S., Marseilles. 061973

2Belovari G. and Campbell J. A., (1980), Generating Contours of Integration: An Application of PROLOG in Symbolic Computing. In 5th Conference on Automated Deduction (Bibel W. and Kowalski R., Eds.) Springer-Verlag. Lecture Notes in Computer Science 87, pp. 14–23.

3Bundy A., (1979), MECHO: A Program to Solve Mechanics Problems. DAI Working Paper No. 50. Univ. of Edinburgh.

4Burstall R. M., Darlington J. (1977), Transformation for Developing Recursive Programs. J. ACM Vol. 24 No. 1. pp. 44–67.

5Clark K. L. and Sickel S. (1977), Predicate Logic: A Calculus for Deriving Programs. Proc. 5th Int. Joint Conf. on Artificial Intelligence. Cambridge, Mass.

6Clark K. L., Tarnlund S.-A., (1977), A First Order Theory of Data and Programs. Proceedings IFIP 77. North Holland, pp. 939–944.

7Clark K. L., (1978), Negation as Failure. Logic and Data Bases. Plenum Press. New York, pp. 293–322.

8Clark K. L., Darlington J., (1978), Algorithm Classification through Synthesis. Computer Journal, pp. 61–65.

9Clark K. L., and McCabe F. G., (1979), Control Facilities of IC-PROLOG. Expert Systems in the Micro-electronic age. (Michie D., Ed.). Edinburgh University Press.

10Clark K. L. and McCabe F. G., (1980), PROLOG: A Language for Implementing Expert Systems. In Machine Intelligence10 (Hayes J. and Michie D., Eds.) Ellis and Horwood.

11Clark K. L., (1980), Logic as a Programming Calculus, to be published by Springer-Verlag.

12Clark K. L. and Gregory S., (1981), A Relational Language for Parallel Programming. In Functional Programming and Computer Architecture, ACM, New York.

13Clark K. L., Ennals J. R. and McCabe F. G., (1981), A Micro-PROLOG Primer. Logic Programming Associates Ltd., 36 Gorst Road, London SW11 6JE.

14Clocksin W. F. and Mellish C. S. (1981), Programming in Prolog. Springer-Verlag.

15Colmerauer A., Kanoui H., Pasero R., Roussel P., (1973), Un Systeme de Communication Homme-machine en Francais. Rapport, Groupe Intelligence Artificielle, Universite d'aix Marseille, Luminy.

16Colmerauer A., (1977), An Interesting Natural Language Subset. Logic Programming (Clark K. and Tarnlund S.-A., Eds.). Academic Press. 1982.

17Colmerauer A. (1978), Metamorphosis Grammars. Natural Language Communication with Computers, (Bolc L., Ed.), Lecture Notes in Computer Science No. 63, Springer-Verlag, Berlin, Heidelberg, New York. pp. 133–189.

18Conery J. S. and Kibler D. F., (1981), Parallel Interpretation of Logic Programs. In Functional Programming and Computer Architecture, ACM, New York.

19Dahl V., (1979), Quantification in a Three-valued Logic for Natural Language Question-answering Systems. Proc. 6th IJCAI, Tokyo.

20Darlington J. and Reeve M., (1981), ALICE: A Multi-processor Reduction Machine for the Parallel Evaluation of Applicative Languages. In Functional Programming and Computer Architecture. ACM, New York.

21Darvas F., Futo I., Szeredi P., (1978), The Application of PROLOG to the Development of QA and DBM Systems. Logic and Data Bases. Plenum Press, New York, pp. 347–375.

[22]Deliyanni A., Kowalski R. A., (1979), Logic and Semantic Networks. Comm. ACM. Vol. 22. No. 3, pp. 184–192.

[23]Dewar R. B. K., Grand A., Liu S-C., Schwartz J. and Schonberg E. (1979), Programming by Refinement, as exemplified by the SETL representation sublanguage, ACM Transactions on Programming Languages and Systems, Vol. 1. No. 1, pp. 27–49.

[24]van Emden M. H., and Kowalski R. A., (1976), The Semantics of Predicate Logic as a Programming Language. J. ACM, Vol. 23, No. 4, pp. 733–742.

25van Emden M. H. (1978), Computation and Deductive Information Retrieval. Formal Description of Programming Concepts, (Neuhold E., Ed.), North Holland, pp. 421–440.

26Ennals J. R., (1981), Logic as a Computer Language for Children: A One Year Course. DoC. 81/6, Imperial College, London.

27Gallaire H., Minker J., (Editors), (1978), Logic and Data Bases. Plenum Press. New York.

28Gallaire H., (1981), The Impact of Logic on Database. Seventh International Conference on Very Large Data Bases. Cannes.

29Hayes P. J., (1973), Computation and Deduction. Proc. 2nd MFCS Symp. Czechoslovak Academy of Sciences, pp. 105–118.

[30]Hayes P. J., (1977), In Defense of Logic. International Joint Conference on Artificial Intelligence, 5, pp. 559–565.

31Hogger C. J., (1978), Goal Oriented Derivation of Logic Programs. Proc. MFCS Conf., Polish Academy of Sciences, Zakopane.

32Hogger C. J., (1978), Program Synthesis in Predicate Logic. Proc. AISB/GI Conf. on AI. Hamburg. 07, 18–20.

33Hogger C. J., (1980), Logic Representation of a Concurrent Algorithm. Imperial College, London.

[34]Hogger C. J., (1981), Derivation of Logic Programs, JACM, Vol. 28, No. 2, pp. 372–392.

35JIPDEC (1981), Proceedings of International Conference on Fifth Generation Computer Systems.Tokyo.

36Kowalski R. A., (1974), Predicate Logic as Programming Language. Proc. IFIP 74. North Holland Publishing Co., Amsterdam, pp. 569–574.

37Kowalski R. A., (1979), Algorithm=Logic+Control. CACM, 081979.

38Kowalski R. A., (1979), Logic for Problem Solving. North Holland Elsevier. New York.

39Kowalski R. A., (1981), Prolog as a Logic Programming Language. Proceedings of AICA Congress. Pavia, Italy.

40McCabe F. G., (1980–1981), Micro-PROLOG Programmer's Reference Manual. Logi, Programming Associates Ltd., 36 Gorst Road, London SW11 6JE.

41McDermott D., (1980), The Prolog Phenomenon. SIGART Newsletter, No. 72, pp. 16–20.

42Markusz Z., (1977), How to design variants of flats using the programming language PROLOG based on mathematical logic. Proc. IFIP 77 pp. 885–889.

43Operating Systems, Inc. (1979), A Knowledge Based Automated Message Understanding Methodology for an Advanced Indications System. OSI R79–006, Woodland Hills, Ca.

44Pollard G. H., (1982), Parallel Execution of Horn Clause Programs. Ph.D. thesis. Imperial College, London.

45Reiter R., (1978), On Closed World Data Bases. Logic and Data Bases, (Gallaire H. and Minker J., Eds.), Plenum Press, New York, pp. 55–76.

46Roussel P., (1975), PROLOG: Manuel de Reference et d'Utilisation. Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille, Luminy.

47Rieger C., Trigg R. and Bane B., (1981), ZMOB: A New Computing Engine for AI. Maryland Artificial Intelligence Group, University of Maryland.

48Shapiro E. Y., (1981), An Algorithm That Infers Theories from Facts. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence,Vancouver B.C.;,Canada, pp. 446–451.

49Shapiro E. Y., (1981), The Model Inference System. Program Demonstration in Proceedings of the Seventh International Joint Conference on Artificial Intelligence,Vancouver B.C.,Canada, p. 1064.

50Warren D. H., (1976), Generating Conditional Plans and Programs. Proc. AISB Summer Conference, Edinburgh, pp. 344–354.

51Warren D. H., Pereira L. M., Pereira F., (1979), PROLOG – The Language and its Implementation Compared with LISP. Proc. Symp. on AI and Programming Languages, SIGPLAN Notices, Vol. 12, No. 8.

52Warren D., (1981), Higher-order Extensions to Prolog – Are they needed? To appear in “Machine Intelligence 10”. Ellis and Horwood.

53Burstall R. M., MacQueen D. B. and Sanella D. T. (1980), HOPE: an experimental applicative language. Proc. LISP conference, Stanford, pp. 136–143.

54Turner D., (1981), The Semantic Elegance of Applicative Languages. In Functional Programming and Computer Architecture. ACM, New York.