Abstract
Since Kowalski (1974) defined the framework for the procedural interpretation of Horn clauses, many models and techniques have been designed for the implementation of logic programming languages. These techniques are mainly concerned with the implementation of logic programming systems on sequential Von Neumann architectures. The major problem of these implementation derives from their low efficiency compared to imperative languages. The main reason for this is that the high level of the logic programming paradigm requires more than a translation to generate the machine code of a logic program. Thus, some overhead is added to bridge the gap between the logic programming level and the machine level. On the other hand, imperative languages are closer than logic languages to the machine level because they embody many concepts of the Von Neumann architecture.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Biswas P., Su S.C., and Yun D.Y.Y., “A scalable abstract machine to support limited-OR/restricted-AND parallelism in logic programs,” Proc. Fifth Int. Conference and Symposium on Logic Programming, MIT Press, pp. 1160–1179, 1988.
Cannataro M., Spezzano G., and Talia D., “A parallel logic system on a multicomputer architecture”, Future Generation Computer Systems, North-Holland, vol. 6, no. 4, pp. 317–331, 1991.
Cannataro M., Gallizzi E., Spezzano G., and Talia D., “Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers”, Concurrency: Practice and Experience, vol. 4, no. 2, pp. 143–161, April 1992a.
Cannataro M., Sergeyev Ya., Spezzano G., and Talia D., “A probabilistic load balancing strategy with neighbourhood synchronization for multicomputer systems,” submitted for publication, 1992b.
Conery J.S., Parallel Execution of Logic Programs, Kluwer Academic Publisher, 1987.
Conery J.S., “Bindings environments for parallel logic programs in non-shared memory multiprocessor”, Technical Report, Univ. of Oregon, 1988.
DeGroot D., “Restricted AND-parallelism”, Proc. Int. Conf. on Fifth Generation Computer Systems 1984, pp. 471–478, ICOT, Tokyo, 1984.
Francez N., “Distributed termination,” ACM Trans, on Programming Languages and Systems, vol. 2, no. 1, pp. 42–55, 1980.
Kalé L. V., “The REDUCE-OR process model for parallel execution of logic programs”, The Journal of Logic Programming, North-Holland, vol. 11, pp. 55–84, 1991.
Inmos, Occam 2 Reference Manual, Prentice Hall, England, 1988.
Inmos, Transputer Databook, Inmos Ltd., England, 1989.
Kowalski R., “Predicate logic as programming language”, IFIP Information Processing, North-Holland, pp. 569–574, 1974.
Seitz C, “Concurrent VLSI architectures”, IEEE Trans, on Computers, vol. C-33, pp. 1247–1265, 1984.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cannataro, M., Spezzano, G., Talia, D. (1994). PALM: A Logic Programming System on a Highly Parallel Architecture. In: Delgado-Frias, J.G., Moore, W.R. (eds) VLSI for Neural Networks and Artificial Intelligence. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1331-9_25
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1331-9_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1333-3
Online ISBN: 978-1-4899-1331-9
eBook Packages: Springer Book Archive