Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project

  • Kazunori UedaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9613)


The technical goal of the Fifth Generation Computer Systems (FGCS) project (1982–1993) was to develop Parallel Inference technologies, namely systematized technologies for realizing knowledge information processing on top of parallel computer architecture [8].


  1. 1.
    Armstrong, J.: Erlang. Commun. ACM 53(9), 68–75 (2010)CrossRefGoogle Scholar
  2. 2.
    Benton, N., Cardelli, L., Fournet, C.: Modern concurrency abstractions for C\({}^{\sharp }\). In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 415–440. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Chandy, K.M., Kesselman, C.: CC++: A Declarative Concurrent Object-Oriented Programming Notation. In: Research Directions in Concurrent Object-Oriented Programming, The MIT Press, 281–313 (1993)Google Scholar
  4. 4.
    Charles, P., et al.: X10: An object-oriented approach to non-uniform cluster computing. In: OOPSLA 2005, pp. 519–538. ACM (2005)Google Scholar
  5. 5.
    Foster, I., Olson, R., Tuecke, S.: Productive parallel programming: The PCN approach. Sci. Program. 1(1), 51–66 (1992)Google Scholar
  6. 6.
    Frühwirth, T.: Theory and practice of Constraint Handling Rules. J. Log. Program. 37(1–3), 95–138 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Gupta, V., Jagadeesan, R., Saraswat, V., Bobrow, D.G.: Programming in hybrid constraint languages. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  8. 8.
    Fuchi, K., Kowalski, R., Furukawa, K., Ueda, K., Kahn, K., Chikayama, T., Tick, E.: Launching the new era. Commun. ACM 36(3), 49–100 (1993)CrossRefGoogle Scholar
  9. 9.
    Fujita, H., Hasegawa, R.: A model-generation theorem prover in KL1 using a ramified stack algorithm. In: 8th International Conference on Logic Programming (ICLP’91), pp. 535–548. The MIT Press (1991)Google Scholar
  10. 10.
    Hasegawa, R., Fujita, H., Koshimura, M., Shirai, Y.: A model generation based theorem prover MGTP for first-order logic. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 178–213. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Johnson, E., Gannon, D.: HPC++: Experiments with the parallel standard template library. In: 11th International Conference on Supercomputing, pp. 124–131. ACM (1997)Google Scholar
  12. 12.
    Maher, M.J.: Logic semantics for a class of committed-choice programs. In: Fourth International Conferenceon Logic Programming (ICLP’87), pp. 858–876. The MIT Press (1987)Google Scholar
  13. 13.
    Milner, R.: The Space and Motion of Communicating Agents. The Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  14. 14.
    Saraswat, V.A., Rinard, M.: Concurrent constraint programming (Extended Abstract). In: POPL 1990, pp. 232–245. ACM (1990)Google Scholar
  15. 15.
    Shapiro, E.Y.: A Subset of Concurrent Prolog and Its Interpreter. ICOT Tech. Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo (1983)Google Scholar
  16. 16.
    Tick, E.: The deevolution of concurrent logic programming languages. J. Log. Program. 23(2), 89–123 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Ueda, K.: Guarded Horn Clauses. ICOT Technical Report TR-103, Institute for New Generation Computer Technology (ICOT), Tokyo (1985). In: Wada, E. (ed.) Logic Programming. LNCS, vol. 221, pp. 168–179. Springer, Heidelberg (1986)Google Scholar
  18. 18.
    Ueda, K., Morita, M.: Moded Flat GHC and its message-oriented implementation technique. New Gener. Comput. 13(1), 3–43 (1994)CrossRefGoogle Scholar
  19. 19.
    Ueda, K.: Concurrent logic/constraint programming: The next 10 years. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 53–71. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  20. 20.
    Ueda, K.: Logic programming and concurrency: A personal perspective. ALP News Lett. 19(2), 37–52 (2006)Google Scholar
  21. 21.
    Ueda, K.: Logic and constraint programming versus concurrency. Comput. Softw. 25(3), 49–54 (2008). Google Scholar
  22. 22.
    Ueda, K.: LMNtal as a hierarchical logic programming language. Theor. Comput. Sci. 410(46), 4784–4800 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Ueda, K., Ayano, T., Hori, T., Iwasawa, H., Ogawa, S.: Hierarchical graph rewriting as a unifying tool for analyzing and understanding nondeterministic systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 349–355. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringWaseda UniversityTokyoJapan

Personalised recommendations