Skip to main content
SpringerLink
Log in

The role of logic programming in the Fifth Generation Computer Project

  • Leading Article
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper describes the role of logic programming in the Fifth Generation Computer Project. We started the project with the conjecture that logic programming is the “bridge” connecting knowledge information processing and parallel computer architecture. Four years have passed since we started the project, and now we can say that this conjecture has been substantially confirmed. The paper gives an overview of the developments which have reinforced this foundational conjecture and how our “bridge” is being realized.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramson, H., “Definite Clause Translation Grammars,”Proc. 1984 Int. Symp. on Logic Programming, IEEE Computer Society, pp. 233–240, 1984.

  2. Barwise, J. and Perry, J.,Situations and Attitudes, MIT Press, 1983.

  3. Bowen, K. A. and Kowalski, R., “Amalgamating Language and Metalanguage in Logic Programming,” inLogic Programming (K. L. Clark and S.-Ä. Tärnlund eds.), Academic Press, pp. 153–172, 1982.

  4. Bowen, K., “Meta-Level Programming and Knowledge Representation,” New Generation Computing, 3, pp. 359–383, 1985.

  5. Bundy, A., Byrd, L., Luger, G., Mellish, C., Milne, R. and Palmer, M., “Solving Mechanics Problems Using Meta-Level Inference,”Proc. 6th IJCAI, Tokyo, 1979.

  6. Bundy, A. and Welham, B., “Using Meta-Level Inference for Selective Application of Multiple Rewrite Rules in Algebraic Manipulation,”Artif. Intell., 16, pp. 189–212, 1981.

    Article  MathSciNet  Google Scholar 

  7. Burstall, R. M. and Darlington, J., “A Transformation System for Developing Recursive Programs,”J. ACM, 24, pp. 46–67, 1977.

    Article  MathSciNet  Google Scholar 

  8. Carlsson, M. and Kahn, K. M., “LM-Prolog User Manual,”Tech. Report, 24, UP-MAIL, Computer Science Dept., Uppsala Univ. 1983.

  9. Chikayama, T., “ESP Reference Manual,”Tech. Report, TR-044, ICOT, 1984.

  10. Chikayama, T., “Unique Features of ESP,”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 292–306, 1984.

  11. Clark, K. L. and Sickel, S., “Predicate Logic: A Calculus for Deriving Programs,”Proc. 5th IJCAI, Cambridge, pp. 419–420, 1977.

  12. Clark, K. L., “Negation as Failure,” inLogic and Data Bases (H. Gallaire and J. Minker eds.), Plenum Press, pp. 293–322, 1978.

  13. Clark, K. L. and Gregory, S., “A Relational Language for Parallel Programming,”Proc. 1981 Conf. on Functional Programming Languages and Computer Architecture, ACM, pp. 171–178, 1981.

  14. Clark, K. L., McCabe, F. and Gregory, S., “IC-Prolog Language Features,” inLogic Programming (K. L. Clark and S.-Å. Tärnlund eds.), Academic Press, pp. 253–266, 1982.

  15. Clark, K. L. and Gregory, S., “PARLOG: Parallel Programming in Logic,”Research Report DOC 84/4, Dept. of Computing, Imperial College of Science and Technology, London, 1984.

    Google Scholar 

  16. Codish, M., “Compiling OR-parallelism into AND-parallelism,”Master Thesis, Computer Science, Feinberg Graduate School of the Weizmann Institute of Science, Rehovot, 1985.

    Google Scholar 

  17. Colmerauer, A., “Les Systèmes-Q ou un Formalisme pour Analyser er Synthétiser des Phrase sur Ordinateur,”Internal Publication 43, Départment d’Informatique, Université de Montreal, 1970.

  18. Colmerauer, A., “Metamorphosis Grammars,” inNatural Language Communication with Computers (L. Bolc ed.), Springer-Verlag, 1978.

  19. Colmerauer, A., “Prolog II: Reference Manual and Theoretical Model,”Internal Report, Groupe Intelligence Artificielle, Université d’Aix-Marseille II, 1982.

  20. Dahl, V., “Two Solutions for the Negation Problem,” inLogic Programming Workshop (S.-Å. Tärnlund ed.), Debrecen, Hungary, 1980.

    Google Scholar 

  21. Dahl, V., “Translating Spanish into Logic through Logic,”Am. J. Comput. Linguist., 7, pp. 149–164, 1981.

    Google Scholar 

  22. Dahl, V., “On Database Systems Development through Logic,”ACM Trans. on Database Syst., 7, pp. 102–123, 1982.

    Article  MathSciNet  Google Scholar 

  23. Dahl, V. and Abramson, H., “On Gapping Grammars,”Proc. Second Int. Logic Programming Conf., Uppsala Univ., pp. 77–88, 1984.

  24. Dahl, V., “More on Gapping Grammars,”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 669–677, 1984.

  25. Davis, R. and Buchanan, B. G., “Meta-Level Knowledge: Overview and Applications,”Proc. 5th IJCAI, Cambridge, pp. 920–927, 1977.

  26. Ferrand, G., Error Diagnosis in Logic Programming: An Adaptation of E. Y. Shapiro’s Method,Rapport de Recherche, 375, INRIA, 1985.

  27. Futamura, Y., “Partial Evaluation of Computation Process: An Approach to a Compiler-Compiler,”Systems, Computers, Controls, 2, pp. 721–728, 1971.

    Google Scholar 

  28. Gallaire, H. and Minker, J. eds.,Logic and Data Bases, Plenum Press, 1978.

  29. Gallaire, H., Minker, J. and Nicolas, J.-M., eds.,Advances in Data Base Theory, Vol. 1, Plenum Press, 1981.

  30. Gallaire, H., Minker, J. and Nicolas, J.-M. eds.,Advances in Data Base Theory, Vol. 2, Plenum Press, 1984.

  31. Gallaire, H., Minker, J. and Nicolas, J.-M., “Logic and Databases: A Deductive Approach,”Computing Surveys, 16, pp. 153–185, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  32. Gazdar, G., “Phrase Structure Grammar,” inThe Nature of Syntactic Representation (P. Jacobson and G. K. Pullum eds.), D. Reidel, pp. 131–186, 1982.

  33. Gazdar, G., Klein, E., Pullum, G. and Sag, I.,Generalized Phrase Structure Grammar, Basil Blackwell, 1985.

  34. Goebel, R. and Furukawa, K., “Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic Reasoning,”Proc. Third Int. Conf. on Logic Programming, Springer-Verlag, 1986.

  35. Hogger, C. J., “Derivation of Logic Programs,”J. ACM, 28, pp. 372–422, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  36. Kahn, K., “A Partial Evaluator of Lisp Written in a Prolog Written in Lisp Intended to be Applied to the Prolog and Itself Which in Turn is Intended to be Given to Itself Together with the Prolog to Produce a Prolog Compiler,UPMAIL, Dept. of Computing Science, Uppsala Univ., 1982.

  37. Kaplan, R. and Bresnan, J., “Lexical-Functional Grammar: A Formal System for Grammatical Representation,” inThe Mental Representation of Grammatical Relations (J. Bresnan ed.) MIT Press, pp. 173–281, 1982.

  38. Kay, M., “Unification in Grammar,”Proc. First Workshop on Natural Language Understanding and Logic Programming (V. Dahl and P. Saint-Dizier eds.), Rennes, France, 1984.

  39. Komolowski, H. J., “A Specification of Abstract Prolog Machine and Its Application to Partial Evaluation,”Linköping Studies in Science and Technology Dissertations, No. 69, Linköping Univ., 1981.

  40. Kowalski, R. A., “Predicate Logic as Programming Language,”Proc. IFIP ’74, North-Holland, pp. 569–574, 1977.

  41. Kowalski, R. A., “Logic for Data Description,” inLogic and Data Bases (H. Gallaire and J. Minker, eds.), Plenum Press, New York, pp. 77–103, 1978.

    Google Scholar 

  42. Kowalski, R. A.,Logic for Problem Solving, Elsevier Science Publishers B. V., 1979.

  43. Kowalski, R. A., “Logic as a Data Base Language,”Proc. Advanced Seminar on Theoretical Issues in Data Bases, Cetraro, Italy, 1981.

  44. Kowalski, R. A., “Logic Programming in the Fifth Generation,”Proc. Fifth Generation Conf., SPL International, London, 1982.

  45. Kursawe, P., “How to Invent a Prolog Machine,”Proc. Third Int. Conf. on Logic Programming, Springer-Verlag, 1986.

  46. Lloyd, J. L. and Topor, R. W., “Making PROLOG More Expressive,”J. Logic Programming, 1, pp. 225–240, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  47. Lloyd, J. L. and Topor, R. W., “A Basis for Deductive Database Systems,”J. Logic Programming, 2, pp. 93–109, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  48. Lloyd, J. L. and Topor, R. W., “A Basis for Deductive Database Systems II,”Tech. Report 85/6, Dept. of Computer Science, Univ. of Melbourne, 1985.

  49. Lloyd, J. W., “Declarative Error Diagnosis,”Tech. Report 86/3, Dept. of Computer Science, Univ. of Melbourne, 1986.

  50. Lloyd, J. W. and Takeuchi, A., “A Framework for Debugging GHC,” to appear asICOT Tech. Report, 1986.

  51. Matsumoto, Y., Tanaka, H., Hirakawa, H., Miyoshi, H. and Yasukawa, H., “BUP: A Bottom-Up Parser Embedded in Prolog,”New Generation Computing, 1, pp. 145–158, 1983

    Article  MATH  Google Scholar 

  52. McCord, M. C., “Using Slots and Modifiers in Logic Grammars for Natural Language,”Artif. Intell., 18, pp. 327–367, 1982.

    Article  Google Scholar 

  53. McCord, M. C., “Modular Logic Grammars,”Proc. 23rd Annual Meeting of ACL, pp. 104–117, 1985.

  54. Mierowsky, C., Taylor, S., Shapiro, E., Levy, J. and Safra, M., “The Design and Implementation of Flat Concurrent Prolog,”Tech. Report CS85-09, The Weizmann Institute of Science, Rehovot, 1985.

    Google Scholar 

  55. Miyachi, T., Kunifuji, S., Kitakami, H., Furukawa, K., Takeuchi, A. and Yokota, H., “A Knowledge Assimilation Method for Logic Databases,”Proc. 1984 Int. Symp. on Logic Programming, IEEE Computer Society, pp. 118–130, 1984.

  56. Morishita, T. and Hirakawa H., “GDL0: A Grammar Description Language Based on DCG,”Tech. Memorandum TM-0084, ICOT, 1984.

  57. Mukai, K. and Yasukawa, H., “Complex Indeterminates in Prolog and Its Application to Discourse Models,”New Generation Computing, 3, pp. 441–466, 1985.

    Article  Google Scholar 

  58. Naish, L. and Thom, J. A., “The MU-PROLOG Deductive Database,”Tech. Report 83/10, Dept. of Computer Science, Univ. of Melbourne, 1985.

  59. Naish, L., “MU-PROLOG 3.2 Reference Manual,”Tech. Report 85/11, Dept. of Computer Science, Univ. of Melbourne, 1985.

  60. Naish, L., “Negation and Quantifiers in NU-PROLOG,”Tech. Report 85/13, Dept. of Computer Science, Univ. of Melbourne, 1985.

  61. Naish, L., “Negation and Control in Prolog,”Tech. Report 85/12, Dept. of Computer Science, Univ. of Melbourne, 1985.

  62. Nicolas, J.-M., and Gallaire, H., “Database: Theory vs. Interpretation,” inLogic and Data Bases (H. Gallaire and J. Minker eds.), Plenum Press, pp. 33–54, 1978.

  63. Pereira, L. M., Pereira, F. C. N. and Warren, D. H. D., “User’s Guide to Decsystem-10 Prolog,”Occasional Paper No. 15, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1978.

  64. Pereira, F. C. N. and Warren, D. H. D., “Definite Clause Grammars—A Survey of the Formalism and a Comparison with Augmented Transition Networks,”Artif. Intell., 13, pp. 231–278, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  65. Pereira, F. C. N., “Extraposition Grammars,”Am. J. Comput. Linguist., 7, pp. 243–256, 1981.

    Google Scholar 

  66. Pereira, F. C. N. and Warren, D. H. D., “Parsing as Deduction,”SRI Tech. Note 295, 1983. Also inProc. 21st Annual Meeting of ACL, pp. 137–144, 1983.

  67. Pereira, L. M., “Rational Debugging in Logic Programming,”Proc. Third Int. Conf. on Logic Programming, Springer-Verlag, 1986.

  68. Pollard, C. J., “Generalized Phrase Structure Grammars, Head Grammars, and Natural Languages,”Ph. D. Dissertation, Stanford Univ., 1984.

  69. Porto, A., “EPILOG: A Language for Extended Programming in Logic,”Proc. First Int. Logic Programming Conf., pp. 31–37, 1982.

  70. Reiter, R., “On Closed World Database,”Logic and Data Bases (H. Gallaire and J. Minker eds.), Plenum Press, pp. 56–76, 1978.

  71. Reiter, R., “Towards a Logical Representation of Relational Database Theory,” inOn Conceptual Modeling (M. Brodie, J. Mylopoulos and J. W. Schmidt eds.), Springer-Verlag, 1985.

  72. Robinson, J. A., “A Machine-Oriented Logic Based on Resolution Principle,”J. ACM, 12, pp. 23–41, 1965.

    Article  MATH  Google Scholar 

  73. Roussel, P., Prolog:Manual de Reference et d’Utilisation, Groupe d’Intelligence Artificielle, Marseille-Luminy.

  74. Sabatier, P., “Puzzle Grammars,”Proc. First Workshop on Natural Language Understanding and Logic Programming (V. Dahl and P. Saint-Dizier eds.), Rennes, France, 1984.

  75. Shapiro, E. Y., “A Subset of Concurrent Prolog and Its Interpreter,”Tech. Report TR-003, ICOT, 1983.

  76. Shapiro, E. Y.,Algorithmic Program Debugging, MIT Press, 1983.

  77. Shieber, S. M., Uszkoreit, H., Pereira, F. C. N., Robinson, J. J. and Tyson, M., “The Formalism and Implementation of PATR-II”, inResearch on Interactive Acquisition and Use of Knowledge, Artificial Intelligence Center, SRI International, California, 1983.

    Google Scholar 

  78. Shieber, S. M., “An Introduction to Unification-Based Approaches to Grammar,”Proc. 23rd Annual Meeting of the Association for Computational Linguistics, 1985.

  79. Takagi, S., Yokoi, T., Uchida, S., Kurokawa, T., Hattori, T., Chikayama, T., Sakai, K. and Tsuji, J., “Overall Design of SIMPOS,”Proc. Second Int. Logic Programming Conf., Uppsala Univ., pp. 1–12, 1984.

  80. Takeuchi, A. and Furukawa K., “Partial Evaluation of Prolog Programs and Its Application to Meta Programming,”ICOT Tech. Report TR-126, 1985. Also to appear inProc. IFIP ’86, 1986.

  81. Takeuchi, A., “Algorithmic Debugging of GHC Programs,” to appear asICOT Tech. Report, 1986.

  82. Takewaki, T., Takeuchi, A., Kunifuji, S. and Furukawa, K., “Application of Partial Evaluation to the Algebraic Manipulation System and its Evaluation,”Tech. Report TR-148, ICOT, 1985.

  83. Taki, K., Yokota, M., Yamamoto, A., Nishikawa, H., Uchida, S., Nakashima, H. and Mitsuishi, A., “Hardware Design and Implementation of the Personal Sequential Inference Machine (PSI),”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 398–409, 1984.

  84. Taki, K., Kimura, Y., Yokota, M., Chikayama, T. and Uchida, S., “The Overview of Multi-PSI System,”Proc. 32nd Annual Convention IPS Japan, 5Q-8, 1986 [in Japanese].

  85. Tamaki, H. and Sato, T., “Unfold/Fold Transformation of Logic Programs,”Second Int. Logic Programming Conf., Uppsala Univ., pp. 127–138, 1984.

  86. Tärnlund, S.-Å., “Horn Clause Computability,”BIT, 17, pp. 215–226, 1977.

    Article  MATH  Google Scholar 

  87. Uchida, S. and Yokoi, T., “Sequential Inference Machine: SIM-Progress Report,”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 58–69, 1984.

  88. Ueda, K., “Guarded Horn Clauses,”Tech. Report TR-103, ICOT, 1985. Also appear inLogic Programming ’85 (E. Wada ed.),Lecture Notes in Computer Science, 221, Springer-Verlag, 1986.

  89. Ueda, K., “Making Exhaustive Search Programs Deterministic,”Proc. Third Int. Conf. on Logic Programming, Springer-Verlag, 1986.

  90. Warren, D. H., “Implementing PROLOG—Compiling Predicate Logic Programs, Vol. 1–2,”D. A. I. Research Report, No. 39, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1977.

  91. Warren, D. H. D. and Pereira, F. C. N., “An Efficient Easily Adaptable System for Interpreting Natural Language Queries,D. A. I. Research Paper, No. 155, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1981.

  92. Warren D. H. D., “An Abstract Prolog Instruction Set,”Tech. Note, 309, Artificial Intelligence Center, SRI International, 1983.

  93. Woods, W. A., “Transition Network Grammars for Natural Language Analysis,”Comm. ACM, 13, pp. 591–606, 1970.

    Article  MATH  Google Scholar 

  94. Yasukawa, H., Hirakawa, H., Mukai, K., Miyoshi, H. and Tanaka, Y., “The Outline of Discourse Understanding System DUALS,”Tech. Memorandum, TM-0118, ICOT, 1985 [in Japanese].

  95. Yokoi, T., Uchida, S. and ICOT Third Lab., “Sequential Inference Machine: SIM—Its Programming and Operating System,”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 70–81, 1984.

  96. Yokota, M., Yamamoto, A., Taki, K. Nishikawa, H., Uchida, S., Nakajima, K. and Mitsui, M., “A Microprogrammed Interpreter for the Personal Sequential Inference Machine,”Proc. Int. Conf. on Fifth Generation Computer Systems 1984, ICOT, pp. 410–418, 1984.

  97. Yokota, H., Sakai, K. and Itoh, H., “Deductive Database System Based on Unit Resolution,”Proc. Int. Conf. on Data Engineering, IEEE Computer Society, pp. 228–235, 1986.

Download references

Author information

Authors and Affiliations

  1. ICOT Research Center, Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

    Kazuhiro Fuchi & Koichi Furukawa

Authors
  1. Kazuhiro Fuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koichi Furukawa
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Fuchi, K., Furukawa, K. The role of logic programming in the Fifth Generation Computer Project. New Gener Comput 5, 3–28 (1987). https://doi.org/10.1007/BF03037455

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037455

Keywords

Search

Navigation