Skip to main content
Top
Published in:
Cover of the book

2016 | OriginalPaper | Chapter

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

Author : Kazunori Ueda

Published in: Functional and Logic Programming

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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].

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
The FGCS project designed and implemented two Kernel Languages, KL0 and KL1, of which this article focuses on KL1 for the Parallel Inference Machine. KL0 was a Kernel Language for the Sequential Inference Machine developed for quick startup of the project.
 
2
A Japanese word meaning a manor.
 
Literature
2.
go back to reference 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)CrossRef 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)CrossRef
3.
go back to reference 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) 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)
4.
go back to reference Charles, P., et al.: X10: An object-oriented approach to non-uniform cluster computing. In: OOPSLA 2005, pp. 519–538. ACM (2005) Charles, P., et al.: X10: An object-oriented approach to non-uniform cluster computing. In: OOPSLA 2005, pp. 519–538. ACM (2005)
5.
go back to reference Foster, I., Olson, R., Tuecke, S.: Productive parallel programming: The PCN approach. Sci. Program. 1(1), 51–66 (1992) Foster, I., Olson, R., Tuecke, S.: Productive parallel programming: The PCN approach. Sci. Program. 1(1), 51–66 (1992)
7.
go back to reference 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)CrossRef 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)CrossRef
8.
go back to reference 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)CrossRef 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)CrossRef
9.
go back to reference 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) 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)
10.
go back to reference 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)CrossRef 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)CrossRef
11.
go back to reference Johnson, E., Gannon, D.: HPC++: Experiments with the parallel standard template library. In: 11th International Conference on Supercomputing, pp. 124–131. ACM (1997) Johnson, E., Gannon, D.: HPC++: Experiments with the parallel standard template library. In: 11th International Conference on Supercomputing, pp. 124–131. ACM (1997)
12.
go back to reference 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) 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)
13.
go back to reference Milner, R.: The Space and Motion of Communicating Agents. The Cambridge University Press, Cambridge (2009)CrossRefMATH Milner, R.: The Space and Motion of Communicating Agents. The Cambridge University Press, Cambridge (2009)CrossRefMATH
14.
go back to reference Saraswat, V.A., Rinard, M.: Concurrent constraint programming (Extended Abstract). In: POPL 1990, pp. 232–245. ACM (1990) Saraswat, V.A., Rinard, M.: Concurrent constraint programming (Extended Abstract). In: POPL 1990, pp. 232–245. ACM (1990)
15.
go back to reference 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) 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)
17.
go back to reference 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) 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)
18.
go back to reference Ueda, K., Morita, M.: Moded Flat GHC and its message-oriented implementation technique. New Gener. Comput. 13(1), 3–43 (1994)CrossRef Ueda, K., Morita, M.: Moded Flat GHC and its message-oriented implementation technique. New Gener. Comput. 13(1), 3–43 (1994)CrossRef
19.
go back to reference 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)CrossRef 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)CrossRef
20.
go back to reference Ueda, K.: Logic programming and concurrency: A personal perspective. ALP News Lett. 19(2), 37–52 (2006) Ueda, K.: Logic programming and concurrency: A personal perspective. ALP News Lett. 19(2), 37–52 (2006)
23.
go back to reference 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)CrossRef 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)CrossRef
Metadata
Title
Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project
Author
Kazunori Ueda
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-29604-3_1

Premium Partner