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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
11. References
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.
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.
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.
Clark, K.L. and Gregory, S.: "Notes on Systems Programming in PARLOG." In Proc. Int. Conf. on Fitfth Generation Computer Systems, Tokyo 1984.
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)
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)
Nilsson, M.: "FOOLOG — A Small and Efficient Prolog Interpreter," Tech. Rept. no. 20, UPMAIL, Comp. Science Dept. Uppsala, Sweden, 1983.
Nilsson, M.: "The worlds shortest Prolog Interpreter?" In Campbell, J. (ed): "Implementations of Prolog", Ellis Horwood Ltd., Chichester, UK. 1984. p 87–92.
Nilsson, M. and Tanaka, H.: "Cyclic Tree Traversal." To appear In Proc. 3rd Int. Conf. on Logic Programming. London. 1986.
Shapiro, E.Y.: "A Subset of Concurrent Prolog and its Interpreter." Technical Report TR-003, Institute for New Generation Computer Technology. 1983, Tokyo.
Sterling, L. and Codish, M.: "Pressing for Parallellsm: A Prolog Program Made Concurrent," J. Logic Programming, No. 1, 1986. p. 75–92.
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.)
Ueda, K.: "On the Operational Semantics of Guarded Horn Clauses." To appear as Technical Memorandum, Institute for New Generation Computer Technology, 1986, Tokyo.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nilsson, M., Tanaka, H. (1987). - Fleng Prolog - The language which turns supercomputers into parallel prolog machines. In: Wada, E. (eds) Logic Programming '86. LP 1986. Lecture Notes in Computer Science, vol 264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18024-9_32
Download citation
DOI: https://doi.org/10.1007/3-540-18024-9_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18024-1
Online ISBN: 978-3-540-47712-9
eBook Packages: Springer Book Archive