Advertisement

- Fleng Prolog - The language which turns supercomputers into parallel prolog machines

  • Martin Nilsson
  • Hidehiko Tanaka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 264)

Abstract

This paper suggests a new way of executing logic programming languages, using small-grain parallelism on vector parallel computer architectures. The main topic is the general purpose language FLENG Prolog. This is a logic programming language for arbitrary architectures, but is especially designed to run efficiently on vector architectures. The most important contribution of the paper is the described combination of the language FLENG Prolog with vector architectures.

Keywords

Logic Programming Variable Binding Logic Programming Language System Predicate System Primitive 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

11. References

  1. (BL 85).
    Brooks, R. and Lum, L.: "Yes, An SIMD Machine Can Be Used For AI," In Proc. of the Int. Joint Conf. on Artificial Intelligence. Los Angeles, 1985, p 73–79.Google Scholar
  2. (CG 84a).
    Clark, K.L. and Gregory, S.: "PARLOG: Parallel Programming in Logic." Res. Rept. DOC 84/4. Dept. of Computing, Imperlal College of Science and Technology, London. 1984.Google Scholar
  3. (CG 84b).
    Clark, K.L. and Gregory, S.: "Notes on the Implementation of PARLOG." Res. Rept. DOC 84/16. Dept. of Computing, Imperial College of Science and Technology, London. 1984.Google Scholar
  4. (CG 85).
    Clark, K.L. and Gregory, S.: "Notes on Systems Programming in PARLOG." In Proc. Int. Conf. on Fitfth Generation Computer Systems, Tokyo 1984.Google Scholar
  5. (Hir 85).
    Hirata, M.: "Description of Oc and its Applications." In Proc. Second National Conf. of Japan Society of Software Science and Technology, p 153–156. (In Japanese)Google Scholar
  6. (Kan 85).
    Kanada, Y.: "High-speed Execution of Prolog on Supercomputers." In Proc. 26th Programming Symp., Information Processing Society of Japan. 1985, p 47–55. (In Japanese)Google Scholar
  7. (Nil 83).
    Nilsson, M.: "FOOLOG — A Small and Efficient Prolog Interpreter," Tech. Rept. no. 20, UPMAIL, Comp. Science Dept. Uppsala, Sweden, 1983.Google Scholar
  8. (Nil 84).
    Nilsson, M.: "The worlds shortest Prolog Interpreter?" In Campbell, J. (ed): "Implementations of Prolog", Ellis Horwood Ltd., Chichester, UK. 1984. p 87–92.Google Scholar
  9. (NT 86).
    Nilsson, M. and Tanaka, H.: "Cyclic Tree Traversal." To appear In Proc. 3rd Int. Conf. on Logic Programming. London. 1986.Google Scholar
  10. (Sha 83).
    Shapiro, E.Y.: "A Subset of Concurrent Prolog and its Interpreter." Technical Report TR-003, Institute for New Generation Computer Technology. 1983, Tokyo.Google Scholar
  11. (SC86).
    Sterling, L. and Codish, M.: "Pressing for Parallellsm: A Prolog Program Made Concurrent," J. Logic Programming, No. 1, 1986. p. 75–92.Google Scholar
  12. (Ued 86a).
    Ueda, K.: "Guarded Horn Clauses." Doctor's Thesis, Information Engineering Course, The University of Tokyo, 1986. (This very read-worthy thesis is combines some of Ueda's earlier papers with new material.)Google Scholar
  13. (Ued 86b).
    Ueda, K.: "On the Operational Semantics of Guarded Horn Clauses." To appear as Technical Memorandum, Institute for New Generation Computer Technology, 1986, Tokyo.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Martin Nilsson
    • 1
  • Hidehiko Tanaka
    • 1
  1. 1.The Tanaka laboratory, Information Engineering, Department of Electrical EngineeringThe University of TokyoTokyo

Personalised recommendations