Hostname: page-component-77f85d65b8-9nbrm Total loading time: 0 Render date: 2026-04-19T04:24:24.101Z Has data issue: false hasContentIssue false
  • English
  • Français

Logic Programming in the Fifth Generation

Published online by Cambridge University Press:  07 July 2009

Robert Kowalski
Robert Kowalski
Affiliation:
Imperial College, London
Get access Rights & Permissions [Opens in a new window]

Extract

The Japanese Fifth Generation Computer Systems (FGCS) project has chosen logic programming for its core programming language. It has recognized the major contribution that logic programming has to make not only in artificial intelligence but in database systems and software specification as well. It has recognized and intends to exploit the greater potential that logic programming has to offer for taking advantage of the parallelism possible with innovative multiprocessor computer architectures.

Information

Type
Research Article
Information
The Knowledge Engineering Review , Volume 1 , Issue 1 , March 1984 , pp. 26 - 38
Copyright
Copyright © Cambridge University Press 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Bergman, 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. 06 1973Google Scholar
[2]Belovari, 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.CrossRefGoogle Scholar
[3]Bundy, A. et al. , (1979), MECHO: A Program to Solve Mechanics Problems. DAI Working Paper No. 50. Univ. of Edinburgh.Google Scholar
[4]Burstall, R. M., Darlington, J. (1977), Transformation for Developing Recursive Programs. J. ACM Vol. 24 No. 1. pp. 44–67.CrossRefGoogle Scholar
[5]Clark, K. L. and Sickel, S. (1977), Predicate Logic: A Calculus for Deriving Programs. Proc. 5th Int. Joint Conf. on Artificial Intelligence. Cambridge, Mass.Google Scholar
[6]Clark, K. L., Tarnlund, S.-A., (1977), A First Order Theory of Data and Programs. Proceedings IFIP 77. North Holland, pp. 939–944.Google Scholar
[7]Clark, K. L., (1978), Negation as Failure. Logic and Data Bases. Plenum Press. New York, pp. 293–322.CrossRefGoogle Scholar
[8]Clark, K. L., Darlington, J., (1978), Algorithm Classification through Synthesis. Computer Journal, pp. 61–65.Google Scholar
[9]Clark, 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.Google Scholar
[10]Clark, K. L. and McCabe, F. G., (1980), PROLOG: A Language for Implementing Expert Systems. In Machine Intelligence 10 (Hayes, J. and Michie, D., Eds.) Ellis and Horwood.Google Scholar
[11]Clark, K. L., (1980), Logic as a Programming Calculus, to be published by Springer-Verlag.Google Scholar
[12]Clark, K. L. and Gregory, S., (1981), A Relational Language for Parallel Programming. In Functional Programming and Computer Architecture, ACM, New York.Google Scholar
[13]Clark, K. L., Ennals, J. R. and McCabe, F. G., (1981), A Micro-PROLOG Primer. Logic Programming Associates Ltd., 36 Gorst Road, London SW11 6JE.Google Scholar
[14]Clocksin, W. F. and Mellish, C. S. (1981), Programming in Prolog. Springer-Verlag.Google Scholar
[15]Colmerauer, 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.Google Scholar
[16]Colmerauer, A., (1977), An Interesting Natural Language Subset. Logic Programming (Clark, K. and Tarnlund, S.-A., Eds.). Academic Press. 1982.Google Scholar
[17]Colmerauer, 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.CrossRefGoogle Scholar
[18]Conery, J. S. and Kibler, D. F., (1981), Parallel Interpretation of Logic Programs. In Functional Programming and Computer Architecture, ACM, New York.Google Scholar
[19]Dahl, V., (1979), Quantification in a Three-valued Logic for Natural Language Question-answering Systems. Proc. 6th IJCAI, Tokyo.Google Scholar
[20]Darlington, 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.Google Scholar
[21]Darvas, 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.Google Scholar
[22]Deliyanni, A., Kowalski, R. A., (1979), Logic and Semantic Networks. Comm. ACM. Vol. 22. No. 3, pp. 184–192.CrossRefGoogle Scholar
[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.CrossRefGoogle Scholar
[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.CrossRefGoogle Scholar
[25]van Emden, M. H. (1978), Computation and Deductive Information Retrieval. Formal Description of Programming Concepts, (Neuhold, E., Ed.), North Holland, pp. 421–440.Google Scholar
[26]Ennals, J. R., (1981), Logic as a Computer Language for Children: A One Year Course. DoC. 81/6, Imperial College, London.Google Scholar
[27]Gallaire, H., Minker, J., (Editors), (1978), Logic and Data Bases. Plenum Press. New York.CrossRefGoogle Scholar
[28]Gallaire, H., (1981), The Impact of Logic on Database. Seventh International Conference on Very Large Data Bases. Cannes.Google Scholar
[29]Hayes, P. J., (1973), Computation and Deduction. Proc. 2nd MFCS Symp. Czechoslovak Academy of Sciences, pp. 105–118.Google Scholar
[30]Hayes, P. J., (1977), In Defense of Logic. International Joint Conference on Artificial Intelligence, 5, pp. 559–565.Google Scholar
[31]Hogger, C. J., (1978), Goal Oriented Derivation of Logic Programs. Proc. MFCS Conf., Polish Academy of Sciences, Zakopane.CrossRefGoogle Scholar
[32]Hogger, C. J., (1978), Program Synthesis in Predicate Logic. Proc. AISB/GI Conf. on AI. Hamburg. 07, 18–20.Google Scholar
[33]Hogger, C. J., (1980), Logic Representation of a Concurrent Algorithm. Imperial College, London.Google Scholar
[34]Hogger, C. J., (1981), Derivation of Logic Programs, JACM, Vol. 28, No. 2, pp. 372–392.CrossRefGoogle Scholar
[35]JIPDEC (1981), Proceedings of International Conference on Fifth Generation Computer Systems.Tokyo.Google Scholar
[36]Kowalski, R. A., (1974), Predicate Logic as Programming Language. Proc. IFIP 74. North Holland Publishing Co., Amsterdam, pp. 569–574.Google Scholar
[37]Kowalski, R. A., (1979), Algorithm=Logic+Control. CACM, 08 1979.CrossRefGoogle Scholar
[38]Kowalski, R. A., (1979), Logic for Problem Solving. North Holland Elsevier. New York.Google Scholar
[39]Kowalski, R. A., (1981), Prolog as a Logic Programming Language. Proceedings of AICA Congress. Pavia, Italy.Google Scholar
[40]McCabe, F. G., (1980–1981), Micro-PROLOG Programmer's Reference Manual. Logi, Programming Associates Ltd., 36 Gorst Road, London SW11 6JE.Google Scholar
[41]McDermott, D., (1980), The Prolog Phenomenon. SIGART Newsletter, No. 72, pp. 16–20.CrossRefGoogle Scholar
[42]Markusz, Z., (1977), How to design variants of flats using the programming language PROLOG based on mathematical logic. Proc. IFIP 77 pp. 885–889.Google Scholar
[43]Operating Systems, Inc. (1979), A Knowledge Based Automated Message Understanding Methodology for an Advanced Indications System. OSI R79–006, Woodland Hills, Ca.Google Scholar
[44]Pollard, G. H., (1982), Parallel Execution of Horn Clause Programs. Ph.D. thesis. Imperial College, London.Google Scholar
[45]Reiter, R., (1978), On Closed World Data Bases. Logic and Data Bases, (Gallaire, H. and Minker, J., Eds.), Plenum Press, New York, pp. 55–76.CrossRefGoogle Scholar
[46]Roussel, P., (1975), PROLOG: Manuel de Reference et d'Utilisation. Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille, Luminy.Google Scholar
[47]Rieger, C., Trigg, R. and Bane, B., (1981), ZMOB: A New Computing Engine for AI. Maryland Artificial Intelligence Group, University of Maryland.Google Scholar
[48]Shapiro, 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.Google Scholar
[49]Shapiro, 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.Google Scholar
[50]Warren, D. H., (1976), Generating Conditional Plans and Programs. Proc. AISB Summer Conference, Edinburgh, pp. 344–354.Google Scholar
[51]Warren, 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.CrossRefGoogle Scholar
[52]Warren, D., (1981), Higher-order Extensions to Prolog – Are they needed? To appear in “Machine Intelligence 10”. Ellis and Horwood.Google Scholar
[53]Burstall, R. M., MacQueen, D. B. and Sanella, D. T. (1980), HOPE: an experimental applicative language. Proc. LISP conference, Stanford, pp. 136–143.CrossRefGoogle Scholar
[54]Turner, D., (1981), The Semantic Elegance of Applicative Languages. In Functional Programming and Computer Architecture. ACM, New York.Google Scholar