Skip to main content
SpringerLink
Log in

AI Languages and AI Machines: An Overview

  • Conference paper
GWAI-81

Part of the book series: Informatik-Fachberichte ((2252,volume 47))

  • 68 Accesses

Abstract

An overview of programming languages and machine architectures for artificial intelligence is given. Five key very-high-level features of AI languages are described in their relation to underlying high-level features. The realization of these language features by corresponding modules of AI machines is discussed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackerman, W.: Data flow languages. 1979 National Computer Conference, AFIPS Conf. Proc., Vol. 48.

    Google Scholar 

  2. Aho, A. & Corasick, M.: Efficient string matching: An aid to bibliographic search. CACM 18(5), June 1975.

    Google Scholar 

  3. Allen, J.: Anatomy of LISP. McGraw-Hill, New York, 1978.

    MATH  Google Scholar 

  4. Anderson, B.: Programming languages for artificial intelligence: The role of nondeterminism. School of Artificial Intelligence, Univ. of Edinburgh, Experim. Progr. Reports No. 25, March 1972.

    Google Scholar 

  5. Backus, J.: Can programming be liberated from the von Neuman style? CACM 21(8), August 1978.

    Google Scholar 

  6. Baker, H.: List processing in real time on a serial computer. CACM 21(4), April 1978.

    Google Scholar 

  7. Bawden, D. & Greenblatt, R. & Holloway, J. & Knight, T. & Moon, D. & Weinreb, D.: The LISP machine. In: Winston, P. & Brown, R. (Eds.): Artificial intelligence: an MIT perspective. Vol. 2. The MIT Press, Cambridge, Mass. 1979.

    Google Scholar 

  8. Bobrow, D. & Raphael, B.: New programming languages for artificial intelligence research. Computing Surveys 6(3), 1974, 153–174.

    Article  MATH  Google Scholar 

  9. Bobrow, D. & Winograd, T. & The KRL Research Group: Experience with KRL-0 — One cycle of a knowledge representation language. Proc. 5th IJCAI, 1977.

    Google Scholar 

  10. Boley, H.: Five views of FIT programming. Univ. Hamburg, FB Inform., IFI-HH-B-57/79, Sept. 1979.

    Google Scholar 

  11. Boley, H.: A preliminary survey of artificial intelligence machines. KI-Rundbrief, Nr. 20, April 1980. AISB Quarterly, Issue 37, May 1980. SIGART Newsletter, No. 72, July 1980.

    Google Scholar 

  12. Boley, H.: Processing directed recursive labelnode hypergraphs with FIT programs. Univ. Hamburg, FB Inform., IFI-HH-M-81/80, Sept. 1980.

    Google Scholar 

  13. Broy, M. & Pepper, P. & Wirsing, M.: On relations between programs. Proc. Fourth International Symp. on Programming, Paris, April 1980, Springer-Verlag, Berlin, Heidelberg, New York, 1980.

    Google Scholar 

  14. Charniak, E. & Riesbeck, C., & McDermott, D.: Artificial intelligence programming. Lawrence Erlbaum Associates, Hillsdale, N.J., 1980.

    MATH  Google Scholar 

  15. Conference Record of the 1980 LISP Conference. Stanford University. August 1980.

    Google Scholar 

  16. Doran, R.: Architecture of stack machines. In: Chu, Y. (Ed.): High-level language computer architecture. Academic, New York 1975.

    Google Scholar 

  17. Fahlman, S.: Design sketch for a million-element NETL machine. Proc. 1st NCAI-80, Stanford University, August 1980.

    Google Scholar 

  18. Fifth Workshop on Computer Architecture for Non-numeric Processing. SIGIR 15(2), SIGMOD 10(4), March 1980.

    Google Scholar 

  19. Fischer, H. & Raulefs, P.: Design rationale for the interactive programming language CSSA for asynchronous multiprocessor systems. Univ. Bonn, Inst. f. Inform. III, Memo SEKI-BN-79–09, Nov. 1979.

    Google Scholar 

  20. Floyd, R.: Nondeterministic algorithms. JACM 14(4). October 1967.

    Google Scholar 

  21. Foderaro, J.: The FRANZ LISP manual. UC Berkeley, 1980.

    Google Scholar 

  22. Friedman, D. & Wise, D.: Aspects of applicative programming for parallel processing. IEEE Trans. Computers 27(4), April 1978.

    Google Scholar 

  23. Goto, E. & Ida, T. & Hiraki, K. & Suzuki, M. & Inada, N.: FLATS, a machine for numerical, symbolic and associative computing. Proc. 6th IJCAI, 1979.

    Google Scholar 

  24. Greenblatt, R. & Knight, T. & Holloway, J. & Moon, D.: LISP Machine Progress Report. The LISP Machine. MIT, Artificial Intelligence Laboratory, no date.

    Google Scholar 

  25. Guetschow, K. & Stecher, R.: Entwurf eines Multiprozessor-Systems zur Auswertung rekursiver Funktionen. Univ. Hamburg, FB Inform., Mai 1980.

    Google Scholar 

  26. Harel, D. & Pratt, V.: Nondeterminism in logics of programs. MIT, Laboratory for Computer Science, MIT/LCS/TM-98, February 1978.

    Google Scholar 

  27. Hewitt, C.: How to use what you know. Proc. 4th IJCAI, 1975.

    Google Scholar 

  28. Hewitt, C.: The Apiary network architecture for knowledgeable systems. In: [15].

    Google Scholar 

  29. Knight, T. & Moon, D. & Holloway, J. & Steele, G.: CADR. MIT, AI Memo 528, June 1979.

    Google Scholar 

  30. Kohonen, T.: Content-addressable memories. Springer-Verlag, Berlin, Heidelberg, New York, 1980.

    Book  MATH  Google Scholar 

  31. Kowalski, R.: Logic for problem solving. North-Holland, 1979.

    MATH  Google Scholar 

  32. Lea, R.: Associative processing of non-numerical information. In: Boulaye, G. & Lewin, D. (Eds.): Computer architecture. Reidel Publ. Comp., Dordrecht, Boston, 1977.

    Google Scholar 

  33. Leavenworth, B. (Ed.): ACM SIGPLAN symposium on very high level languages. March 1974, SIGPLAN Notices 9(4). C34] McCarthy, J.: LISP — Notes on its past and future. In: [15].

    Google Scholar 

  34. Minsky, M.: Form and content in computer science. JACM 17(2), 1970.

    Google Scholar 

  35. Mukhopadhyay, A.: Hardware algorithms for nonnumeric computation. Proc. 5th Ann. Symp. Computer Architect., SIGARCH 6(7), April 1978.

    Google Scholar 

  36. Nilsson, N.: Principles of artificial intelligence. Tioga, 1980.

    MATH  Google Scholar 

  37. Nivat, M.: Non deterministic programs: An algebraic overview. Proc. IFIP 1980.

    Google Scholar 

  38. Paterson, M. & Wegman, M.: Linear unification. 8th Ann. ACM Symp. on Theory of Computing, May 1976.

    Google Scholar 

  39. Raulefs, P. & Siekmann, J. & Szabo, P., & Unvericht, E.: A short survey on the state of the art in matching and unification problems. Inst. f. Inform. I, Univ. Karlsruhe, SEKI 3–78, 1978.

    Google Scholar 

  40. Schoichet, S.: The LISP machine. Mini-micro systems, June 1978.

    Google Scholar 

  41. Sullivan, H. & Bashkow, T.: A large scale, homogeneous, fully distributed parallel machine, I. Proc. 4th Ann. Symp. Computer Architecture, SIGARCH 5 (7), March 1977.

    Google Scholar 

  42. Sussman, G. & McDermott, D.: Why conniving is better than planning. MIT AI Laboratory, AI Memo No. 255A, April 1972.

    Google Scholar 

  43. The Lisp Company: The TLC-LISP documentation. Box 487, Redwood Estates, CA 95044 1980.

    Google Scholar 

  44. The Mathlab Group: MACSYMA Reference Manual. Version Eight. MIT, Project MAC, November 1975.

    Google Scholar 

  45. Thompson, C. & Kung, H.: Sorting on a mesh-connected parallel computer. 8th Ann. ACM Symp. on Theory of Computing, May 1976.

    Google Scholar 

  46. Treleaven, P. & Brownbridge, D. & Hopkins, R.: Data driven and demand driven computer architecture. The University of Newcastle upon Tyne, Computing Laboratory, July 1980.

    Google Scholar 

  47. Waterman, D. & Hayes-Roth, F. (Eds.): Pattern-directed inference systems. Academic, 1978.

    MATH  Google Scholar 

  48. Weinreb, D. & Moon, D.: Flavors: Message passing in the Lisp machine. MIT, AI Lab., AI Memo No. 602, November 1980.

    Google Scholar 

  49. White, J.: Address/memory management for a gigantic LISP environment or, GC considered harmful. In: [15].

    Google Scholar 

  50. Wilber, M.: A QLISP Reference Manual. Technical Note 118, AI Center, SRI, March 1976.

    Google Scholar 

  51. Winston, P. & Horn, B.: LISP. Addison-Wesley, 1981.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitaet Hamburg, Germany

    Harold Boley

Authors
  1. Harold Boley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, Postfach 6380, 7500, Karlsruhe 1, Germany

    Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boley, H. (1981). AI Languages and AI Machines: An Overview. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02328-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10859-7

  • Online ISBN: 978-3-662-02328-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation