Skip to main content
Springer Nature Link
Log in

Potentiality of parallelism in logic

  • Conference paper
  • First Online:
Parallelization in Inference Systems

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 590))

  • 161 Accesses

Abstract

The processing of knowledge is becoming a major area of applications for computer systems. In contrast to data processing, the current stronghold of computer use, where well-structured data are manipulated through well-defined algorithms, the treatment of knowledge requires more intricate representation schemes as well as refined methods to manipulate the represented information. Among the many candidates proposed for representing and processing knowledge, logic has a number of important advantages, although it also suffers from some drawbacks. One of the advantages is the availability of a strong formal background with a large assortment of techniques for dealing with the representation and processing of knowledge. A considerable disadvantage so far is the amount and complexity of computation required to perform even simple tasks in the area of logic. One promising approach to overcome this problem is the use of parallel processing techniques, enabling an ensemble of processing elements to cooperate in the solution of a problem. The goal of this paper is to investigate the combination of parallelism and logic.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ajjanagadde, V. (1990). Reasoning with function symbols in a connectionist system. Technical report, Department of Computer and Information Science, University of Pennsylvania.

    Google Scholar 

  2. Ajjanagadde, V. and Shastri, L. (1991). Rules and variables in neural nets. Neural Computation, 3:121–134.

    Google Scholar 

  3. Ali, K. (1987). OR-parallel execution of Prolog on a multi-sequential machine. Parallel Programming, 15(3).

    Google Scholar 

  4. Amthor, R. (1989). Simulation eines Beweisers auf einer Multi-Prozessor Architektur. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  5. Aso, M. and Onai, R. (1983). XP's: An Extended OR-Parallel Prolog System. Technical Report TR 023, Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  6. Auburn (1989). Parallel logic programming architectures: Final report. Technical report, Department of Computer Science and Engineering, Auburn University, Auburn, AL.

    Google Scholar 

  7. Bachinger, J. (1987). Implementierung eines parallelen Theorembeweisers und Simulation der Ausführung auf einer Mehrprozessormaschine. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  8. Ballard, D. (1986). Parallel Logical Inference and Energy Minimization. Technical Report TR 142, Computer Science Department, University of Rochester.

    Google Scholar 

  9. Bansal, A. and Potter, J. (1990). A data-parallel model for efficient execution of logic programs on associative supercomputers. In North American Conference on Logic Programming.

    Google Scholar 

  10. Barnden, J. (1988). Simulations of Conposit, a Supra-Connectionist Architecture for Commonsense Reasoning. In 2nd Symposium on the Frontiers of Massively Parallel Computation, Fairfax, VA., Las Cruces.

    Google Scholar 

  11. Baron, U., Chassin, J., and Syre, J. (1988). The Parallel ECRC Prolog System PEPSys: An overview and evaluation results. In FGCS '88.

    Google Scholar 

  12. Baron, U., Ing, B., Ratcliffe, M., and Robert, P. (1987). A Distributed Architecture for the PEPSys Parallel Logic Programming System. Technical report, ECRC Computer Architecture Group, München.

    Google Scholar 

  13. Beer, J. (1989). Concepts, Design, and Performance Analysis of a Parallel Prolog Machine, volume 404 of Lecture Notes in Computer Science. Springer.

    Google Scholar 

  14. Beer, J. and Giloi, W. K. (1987). POPE — A Parallel-Operating Prolog Engine. Future Generations Computer Systems, pages 83–92.

    Google Scholar 

  15. Ben-Ari, M. (1984). Principles of Concurrent Programming, Prentice Hall.

    Google Scholar 

  16. Bibel, W. (1987). Automated Theorem Proving. Vieweg, Braunschweig, Wiesbaden, second edition.

    Google Scholar 

  17. Bibel, W. and Aspetsberger, K. (1985). A Bibliography on Parallel Inference Machines. Symbolic Computation, 1(1):115–118.

    Google Scholar 

  18. Bibel, W. and Buchberger, B. (1984). Towards a Connection Machine for Logic Inference. Future Generation Computer Systems, 1(3):177–188.

    Google Scholar 

  19. Bibel, W. and Jorrand, P., editors (1986). Fundamentals of Artificial Intelligence, volume 232 of Lecture Notes in Computer Science, Berlin. Springer.

    Google Scholar 

  20. Bibel, W., Kurfeß, F., Aspetsberger, K., Hintenaus, P., and Schumann, J. (1987). Parallel inference machines. In [Treleaven and Vanneschi, 1987], pages 185–226.

    Google Scholar 

  21. Bic, L. (1984). A Data-Driven Model for Parallel Interpretation of Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1984, pages 517–523. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  22. Bitar, P. and Chen, C. (1990). The OR+AND Modeling Framework for Parallel Prolog Models. UCB/CSD 90/604, Computer Science Division, University of California, Berkeley, CA 94720.

    Google Scholar 

  23. Blelloch, G. (1989). Scans as primitive parallel operations. IEEE Transactions on Computers, 38(11):1526–1538.

    Google Scholar 

  24. Blelloch, G. and Sabot, G. (1990). Compiling collection-oriented languages onto massively parallel computers. Parallel and Distributed Computing, 8(2):119–134.

    Google Scholar 

  25. Böck, K.-H. (1989). Studying an application for a parallel logic programming system. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  26. Bode, A., editor (1991). Distributed Memory Computing. 2nd European Conference, EDMCC2, number 487 in Lecture Notes in Computer Science, Munich, FRG. Apringer.

    Google Scholar 

  27. Borgwardt, P. (1984). Parallel Prolog Using Stack Segments on Shared Memory Multiprocessors. In International Symposium On Logic Programming, Atlantic City, NJ.

    Google Scholar 

  28. Bose, S., Clarke, E. M., Long, D. E., and Spiro, M. (1989). Parthenon. Technical report, LICS.

    Google Scholar 

  29. Brogi, A. and Gorrieri, R. (1989). A Distributed, Net Oriented Semantics for Delta Prolog. In TAPSOFT '89, pages 162–177.

    Google Scholar 

  30. Caferra, R. and Jorrand, P. (1985). Unification with Refined Linearity Check as a Network of Parallell Processes. Technical report, LIFIA, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle IMAG, Grenoble, France.

    Google Scholar 

  31. Chandy, K. M. and Misra, J. (1988). Parallel Program Design, Addison-Wesley, Reading, MA.

    Google Scholar 

  32. Chassin de Kergommeaux, J., Baron, U., Rapp, W., and Ratcliffe, M. (1988). Performance Analysis of Parallel Prolog: A Correlated Approach. Technical report, ECRC Munich.

    Google Scholar 

  33. Chassin de Kergommeaux, J., Codognet, P., Robert, P., and Syre, J.-C. (1989). Une programmation logique parallele: premiere partie: Langages gardes. Technique et Science Informatiques, 8:205–224.

    Google Scholar 

  34. Cheese, A. (1991). Implementing committed-choice logic programming languages on distributed memory computers. In [Bode, 1991].

    Google Scholar 

  35. Chen, C., Singhal, A., and Patt, Y. N. (1988). PUP: An Architecture to Exploit Parallel Unification in Prolog. Technical Report UCB/CSD 88/414, University of California, Computer Science Department), Berkeley, CA 94720.

    Google Scholar 

  36. Chengzheng, S. and Yungui, C. (1990). The OR-forest-based parallel execution model of logic programs. Future Generation Computer Systems, 6(1):25–34.

    Google Scholar 

  37. Chu, Y. and Itano, K. (1984). Organisation of a Parallel PROLOG Machine. Proc. Intern. Workshop on HLCA.

    Google Scholar 

  38. Ciepielewski, A. and Haridi, S. (1984a). Control of Activities in the ORparallel Token Machine. Technical report, Department Of Telecommunications and Comping Systems, Royal Institute of Technology, Stockholm.

    Google Scholar 

  39. Ciepielewski, A. and Haridi, S. (1984b). Execution of Bagof on the OR-parallel Token Machine. In International Conference on Fifth Generation Computer Systems, pages 551–562, Tokyo.

    Google Scholar 

  40. Citrin, W. (1988). Parallel Unification Scheduling in Prolog. Technical Report UCB/CSD 88/415, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA.

    Google Scholar 

  41. Clark, K. and Gregory, S. (1981). A Relational Language for Parallel Programming. In ACM Conference on Functional Programming Languages and Computer Architecture, pages 171–178.

    Google Scholar 

  42. Clark, K. and Gregory, S. (1984). Notes on Systems Programming in Parlog. Proc. Of the International Conference On Fifth Generation Computer Systems, pages 299–306.

    Google Scholar 

  43. Clark, K. and Gregory, S. (1986). PARLOG: Parallel Programming in Logic. ACM Transactions on Programming Languages and Systems, 1986(8):1–49.

    Google Scholar 

  44. Clark, K. L. (1988). Parlog and Its Applications. IEEE Transactions on Software Engineering, 14:1792–1804.

    Google Scholar 

  45. Colmerauer, A. (1982). Prolog and Infinite Trees. Logic Programming, pages 231–251.

    Google Scholar 

  46. Conery, J. S. (1983). The AND/OR Process Model for Parallel Execution of Logic Programs. PhD thesis, University of California, Irvine. Technical report 204, Department of Information and Computer Science.

    Google Scholar 

  47. Corbin, J. and Bidoit, M. (1983). A Rehabilitation of Robinson's Unification Algorithm. Information Processing '83, pages 909–914.

    Google Scholar 

  48. Corsini, P., Frosini, G., and Rizzo, L. (1989a). Implementing a Parallel PROLOG Interpreter by Using OCCAM and Transputers. Microprocessors and Microsystems, 13(4):271–279.

    Google Scholar 

  49. Corsini, P., Frosini, G., and Speranza, G. (1989b). The Parallel Interpretation of Logic Programs in Distributed Architectures. Computer Journal, 32:29–35.

    Google Scholar 

  50. Crammond, J. (1985). A Comparative Study of Unification Algorithms for OR-Parallel Execution of Logic Languages. IEEE, pages 131–138.

    Google Scholar 

  51. Crammond, J. A. (1986). An Execution Model for Committed-Choice Nondeterministic Languages. In Symposium on Logic Programming '86, pages 148–158.

    Google Scholar 

  52. Crowl, L. A. and LeBlanc, T. J. (1991). Architectural adaptability in parallle programming via control abstraction. Technical Report 359, Department of Computer Science, University of Rochester, Rochester, NY 14627.

    Google Scholar 

  53. Cunha, J. C., Ferreira, M. C., and Moniz Pereira, L. (1989). Programming in Delta Prolog. In Logic Programming Conference '89.

    Google Scholar 

  54. Darlington, J. and Reeve, M. (1983). ALICE and the Parallel Evaluation of Logic Programs. 10th Annual International Symposium on Computer Architecture.

    Google Scholar 

  55. Davison (1989). Polka: A parlog object oriented language. Technical report, Dept. of Computing, Imperial College, London, UK.

    Google Scholar 

  56. de Boer, F. S. and Palamidessi, C. (1990a). Concurrent logic programming: Asynchronism and language comparison. Technical Report TR-6/90, University of Pisa, Department of Computer Science, 56100 Pisa, Italy.

    Google Scholar 

  57. de Boer, F. S. and Palamidessi, C. (1990b). A fully abstract model for concurrent logic languages. Technical Report CS-R9046, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands.

    Google Scholar 

  58. De Nicola, R., Ferrari, G. Observational logics and concurrency models. Technical Report TR-10/90, University of Pisa, Department of Computer Science, 56100 Pisa, Italy.

    Google Scholar 

  59. Debray, S. K. (1989). Static inference of modes and data dependencies in logic programs. ACM Transactions on Programming Languages and Systems, 11(3):419–450.

    Google Scholar 

  60. Debray, S. K., Lin, N.-W., and Hermenegildo, M. (1990). Task granularity analysis in logic programs. Technical Report TR 90-16, Department of Computer Science, University of Arizona, Tucson, AZ 85721.

    Google Scholar 

  61. DeGroot, D. (1984). Restricted AND-Parallelism. In International Conference on Fifth Generation Computer Systems, pages 471–478. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  62. DeGroot, D. (1988). A Technique for Compiling Execution Graph Expressions for Restricted And-Parallelism in Logic Programs. Journal of Parallel and Distributed Computing, (5):494–516.

    Google Scholar 

  63. DeGroot, D. (1990). On the inherently speculative nature of parallel logic programming. In North American Conference on Logic Programming.

    Google Scholar 

  64. Delcher, A. and Kasif, S. (1989). Some results in the complexity of exploiting data dependency in parallel logic programs. Logic Programming, 6:229–241.

    Google Scholar 

  65. Delcher, A. L. and Kasif, S. (1988). Efficient Parallel Term Matching. Technical report, Computer Science Department, Johns Hopkins University, Baltimore, MD 21218.

    Google Scholar 

  66. Delgado-Rannauro, S. A., Dorochevsky, M., Scherman, K., Véron, A., and Xu, J. (1991). A shared environment parallel logic programming system on distributed memory architectures. In [Bode, 1991].

    Google Scholar 

  67. Despain, A., Patt, Y., Dobry, T., Chang, J., and Citrin, W. (1986). High Performance Prolog: The Multiplicative Effect of Several Levels of Implementation. In COMPCON 86, Berkeley.

    Google Scholar 

  68. Despain, A. M. and Patt, Y. N. (1985). Aquarius — A High Performance Computing System for Symbolic and Numeric Applications. In COMPCON '85, Berkeley, CA.

    Google Scholar 

  69. Diel, H., Lenz, N., and Welsch, H. M. (1986). System Structure for Parallel Logic Programming. Future Generation Computer Systems, 2:225–231.

    Google Scholar 

  70. Dixon, M. and deKleer, J. (1988). Massively parallel assumption-based truth maintenance. In Smith, R. G. and Mitchell, T. M., editors, Seventh National Conference on Artificial Intelligence, volume 1/2, pages 199–204, St. Paul, MN. American Association for Artificial Intelligence, Morgan Kaufman.

    Google Scholar 

  71. Dwork, C., Kanellakis, P., and Stockmeyer, L. (1986). Parallel Algorithms for Term Matching. In CADE '86, pages 416–430, Berlin. Springer.

    Google Scholar 

  72. Dwork, C., Kanellakis, P. C., and Stockmeyer, L. (1988). Parallel algorithms for term matching. SIAM Journal of Computing, 17(4):711–731.

    Google Scholar 

  73. Dyer, M. G. (1989). Symbolic processing techniques in connectionist networks and their application to high-level cognitive tasks. In Brauer, W. and Freksa, C., editors, International GI Congress on Knowledge Based Systems, Informatik Fachberichte, Munich. Springer.

    Google Scholar 

  74. Eckmiller, R., Hartmann, G., and Hauske, G., editors (1990). Parallel Processing in Neural Systems and Computers. Elsevier.

    Google Scholar 

  75. Eisenstadt, M. and Brayshaw, M. (1988). The Transparent Prolog Machine (TPM): An Execution Model and Graphical Debugger for Logic Programming. Logic Programming, pages 277–342.

    Google Scholar 

  76. Eliens, A. (1991a). Distributed logic programming for artificial intelligence. AI Communications, 4(1):11–21.

    Google Scholar 

  77. Eliens, A. (1991b). DIP — A Language for Distributed Logic Programming. PhD thesis, Centre for Mathematics and Computer Science, Amsterdam, Netherlands.

    Google Scholar 

  78. Engels, J. (1988). A Model for Or-parallel Execution of (Full) Prolog and its Proposed Implementation. Technical report, Institut für Informatik III, Universität Bonn, Bonn.

    Google Scholar 

  79. Ertel, W. (1990). Random competition: A simple, but efficient method for parallelizing inference systems. Technical Report FKI 143-90, Institut für Informatik, Technische Universität München.

    Google Scholar 

  80. Ertel, W. (1991). Performance of competitive or-parallelism. ICLP Workshop on Parallel Inferencing.

    Google Scholar 

  81. Ertel, W., Kurfeß, F., Letz, R., Pandolfi, X., and Schumann, J. (1989). PARTHEO: A Parallel Inference Machine. In PARLE '89.

    Google Scholar 

  82. Fagin, B. (1990). Data-parallel logic programming. In North American Conference on Logic Programming.

    Google Scholar 

  83. Fagin, B. (1991). Data-parallel logic programming systems. Technical report, Thayer School of Engineering, Dartmouth College, Hanover, NH 03755.

    Google Scholar 

  84. Fagin, B. and Despain, A. M. (1987). Performance Studies of a Parallel Prolog Architecture. Technical report, Computer Science Division, University of California, Berkeley, CA. preprint from ISCA, June '87.

    Google Scholar 

  85. Fagin, B. S. and Despain, A. M. (1990). The performance of parallel Prolog programs. IEEE Transactions on Computers, 39(12):1434–1445.

    Google Scholar 

  86. Fahlman, S. and Hinton, G. (1987). Connectionist Architectures for Artificial Intelligence. Computer, 20:100–118.

    Google Scholar 

  87. Feldman, J. A. (1990). Conventional and connectionist parallel computation. GMD-Spiegel.

    Google Scholar 

  88. Foster, I. (1990). Systems Programming in Parallel Logic Languages. Prentice Hall.

    Google Scholar 

  89. Foster, I. and Taylor, S. (1987). Flat Parlog: A Basis for Comparison. Parallel Programming, 16:87–125.

    Google Scholar 

  90. Foster, I. and Taylor, S. (1989). STRAND: New Concepts in Parallel Programming. Prentice Hall.

    Google Scholar 

  91. Fronhöfer, B. and Kurfeß, F. (1987). Cooperative Competition: A modest proposal concerning the use of multi-processor systems for automated reasoning. Technical report, Institut für Informatik, Technische Universität München.

    Google Scholar 

  92. Futo, I. (1988). Parallele Programmierung in CS-Prolog. Artificial Intelligence Newsletter, 9, 10:13–15,16–19.

    Google Scholar 

  93. Futo, I. and Kacsuk, P. (1989). CS-Prolog on multitransputer systems. Microprocessors and Microsystems, 13:103–112.

    Google Scholar 

  94. Georgescu, I. (1986). An Inference Processor based on reactive memory. Technical report, Institute for Computers and Informatics, Department of Robotics and Artificial Intelligence, Bucharest.

    Google Scholar 

  95. Giambiasi, N., Lbath, R., and Touzet, C. (1989). Une approche connexionniste pour calculer l'implication floue dans les systemes a base de regles. Technical report, Universite de Nimes.

    Google Scholar 

  96. Gonzalez-Rubio, R., Bradier, A., and Rohmer, J. (1987). DDC Delta Driven Computer — a Parallel Machine for Symbolic Processing. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  97. Goto, A., Aida, H., Maruyama, T., Yuhara, M., Tanaka, H., and Moto-OKA, T. (1983). A Highly Parallel Inference Engine: PIE. In Logic Programming Conference. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  98. Goto, A., Sato, M., Nakajima, K., Taki, K., and Matsumoto, A. (1988). Overview of the Parallel Inference Machine Architecture (PIM). In International Conference on Fifth Generation Computer Systems, pages 209–229, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  99. Goto, A., Tanaka, H., and Moto-Oka, T. (1984). Highly Parallel Inference Engine: PIE. Goal Rewriting Model and Machine Architecture. New Generation Computing.

    Google Scholar 

  100. Goto, A. and Uchida, S. (1985). Current Research Status of PIM: Parallel Inference Machine. In Third Japanese-Swedish Workshop, number TM-140. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  101. Goto, A. and Uchida, S. (1986). Toward a High Performance Parallel Inference Machine — The Intermediate State Plan of PIM-. Technical report, Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  102. Goto, A. and Uchida, S. (1987). Towards a High Performance Parallel Inference Machine — The Intermediate Stage Plan for PIM. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  103. Gregory, S. (1984). Implementing PARLOG on the ALICE Machine. Technical report, Imperial College, London.

    Google Scholar 

  104. Gregory, S. (1987). Parallel Logic Programming with PARLOG: The Language and its Implementation. Addison Wesley.

    Google Scholar 

  105. Gregory, S., Foster, I. T., Burt, A. D., and Ringwood, G. A. (1989). An Abstract Machine for the Implementation of PARLOG on Uniprocessors. New Generation Computing, (6):389–420.

    Google Scholar 

  106. Güntzer, U., Kiessling, W., and Bayer, R. (1986). Evaluation Paradigms for Deductive Databases: from Systolic to As-You-Please. Technical Report TUM-I-86-05, Institut für Informatik, Technische Universität München.

    Google Scholar 

  107. Hager, J. and Moser, M. (1989). An Approach to Parallel Unification Using Transputers. In GWAI '89, pages 83–91. Springer.

    Google Scholar 

  108. Hailperin, M. and Westphal, H. (1986). A Computational Model for PEPSys. Technical Report CA-16, ECRC.

    Google Scholar 

  109. Halim, Z. (1986). A Data-Driven Machine for Or-Parallel Evaluation of Logic Programs. New Generation Computing, Vol.4, No.1:5–33.

    Google Scholar 

  110. Harland, J. and Jaffar, J. (1987). On Parallel Unification for Prolog. New Generation Computing, 5:259–279.

    Google Scholar 

  111. Hattori, A., Shinogoi, T., Kumon, K., and Goto, A. (1989). PIM-p: A Hierarchical Parallel Inference Machine. Technical Report TR-514, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

    Google Scholar 

  112. Hellerstein, L. and Shapiro, E. (1986). Implementing Parallel Allgorithms in Concurrent Prolog: The Maxflow Experience. Logic Programming, 2:157–184.

    Google Scholar 

  113. Hermenegildo, M. (1986). An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs. In Third International Conference On Logic Programming 86, pages 25–39.

    Google Scholar 

  114. Hermenegildo, M. and Nasr, R. (1986). Efficient Management of Backtracking in AND-Parallelism. In Third International Conference On Logic Programming 86, pages 40–54.

    Google Scholar 

  115. Hermenegildo, M. and Rossi, F. (1989). On the Correctness and Efficiency of Independent AND-Parallelism in Logic Programs. In North American Conference on Logic Programming, pages 369–389. MIT Press.

    Google Scholar 

  116. Hertzberger, L. and van de Riet, R. (1984). Progress in the Fith Generation Inference Architectures. Future Generations Computer Systems, 1(2):93–102.

    Google Scholar 

  117. Hillis, D. W. (1985). The Connection Machine. MIT Press, Cambridge, MA.

    Google Scholar 

  118. Hillis, W. and Steele, G. (1986). Data Parallel Algorithms. Communications of the ACM, 29:1170–1183.

    Google Scholar 

  119. Hillyer, B. and Shaw, D. (1983). Rapid Execution of AI Production Systems on the NON-VON Supercomputer. Technical report, Department of Computer Science, Columbia University, New York.

    Google Scholar 

  120. Hölldobler, S. (1990a). CHCL — a connectionist inference system for horn logic based on the connection method. Technical Report TR-90-042, International Computer Science Institute, Berkeley, CA 94704.

    Google Scholar 

  121. Hölldobler, S. (1990b). A structured connectionist unification algorithm. In AAAI '90, pages 587–593. A long version appeared as Technical Report TR-90-012, International Computer Science Institute, Berkeley, CA.

    Google Scholar 

  122. Hölldobler, S. (1990c). Towards a connectionist inference system. In Proceedings of the International Symposium on Computational Intelligence.

    Google Scholar 

  123. Hölldobler, S. and Kurfeß, F. (1991). CHCL — A Connectionist Inference System. International Computer Science Institute.

    Google Scholar 

  124. Houri, A. and Shapiro, E. (1986). A Sequential Abstract Machine for Flat concurrent Prolog. Technical Report CS86-20, Weizmann Institute of Science, Rehovot, Isael.

    Google Scholar 

  125. Hwang, K. and Briggs, F. (1984). Computer Architecture and Parallel Processing. Mc Graw-Hill, New York.

    Google Scholar 

  126. Hwang, K., Ghosh, J., and R.Chokwanyun (1987). Computer Architectures for Artificial Intelligence Processing. Computer, 20:19–30.

    Google Scholar 

  127. Ibañez, M. B. (1988). Parallel inferencing in first-order logic based on the connection method. In Artificial Intelligence: Methodology, Systems, Applications '88. Varna, North-Holland.

    Google Scholar 

  128. Ibañez, M. B. (1989). Inférence parallèle et processus communicants pour les clauses de Horn. Extension au premier ordre par la méthode de connexion. PhD thesis, I.N.P. de Grenoble, France.

    Google Scholar 

  129. ICLP91 (1991). ICLP 91 Workshop on Parallel Execution of Logic Programs, Paris, France.

    Google Scholar 

  130. Ino, E. and Koelbl, D. (1988). Sequentielle und parallele Architekturansätze für logische Programmiersprachen. Informatik Forschung und Entwicklung, 3:182–194.

    Google Scholar 

  131. Ito, N., Kuno, E., and Oohara, T. (1987). Efficient Stream Processing in GHC and Its Evaluation on a Parallel Inference Machine. Journal of Information Processing, 10:237–244.

    Google Scholar 

  132. Ito, N., Masuda, K., and Shimizu, H. (August 1983a). Parallel Prolog Machine. Technical report, Institute for New Generation Computer Technology (ICOT), Tokyo.

    Google Scholar 

  133. Ito, N. and Masuda, Y. (1983). Parallel Inference Machine Based on the Data Flow Model. Technical Report TR-033, Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  134. Ito, N., Onai, R., Masuda, K., and Shimizu, H. (1983b). Parallel Prolog Machine Based on Data Flow Mechanism. In Logic Programming Conference '83. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  135. Jorrand, P. (1986). Term Rewriting as a Basis for the Design of a Functional and Parallel Programming Language. A case study: the Language FP2. In [Bibel and Jorrand, 1986], pages 221–276.

    Google Scholar 

  136. Jorrand, P. (1987). Design and Implementation of a Parallel Inference Machine for First-Order Logic: An Overview. In PARLE 87, volume 258 of Lecture Notes in Computer Science, Berlin. Springer.

    Google Scholar 

  137. Kacsuk, P. (1991). A Parallel PROLOG Abstract Machine and its Multi-Transputer Implementation. Computer, 34(1):52–63.

    Google Scholar 

  138. Kacsuk, P. and Bale, A. (1987). DAP Prolog: A Set-oriented Approach to Prolog. Computer, 30(5):393–403.

    Google Scholar 

  139. Kahn, K. e. a. (1986). Objects in concurrent logic languages. In OOPSLA 86, pages 242–257.

    Google Scholar 

  140. Kalé, L. (1988). A Tree Representation for Parallel Problem Solving. In AAAI '88, pages 677–681.

    Google Scholar 

  141. Kalé, L. V. (1985). Parallel Architectures for Problem Solving. PhD thesis, State University of New York, Stony Brook.

    Google Scholar 

  142. Kalé, L. V. (1987). Completeness and full parallelism of parallel logic programming schemes. In IEEE Symposium on Logic Programming, pages 125–133, San Francisco, CA. IEEE.

    Google Scholar 

  143. Kalé, L. V. (1989). The REDUCE OR Process Model for Parallel Execution of Logic Programs. Journal of Logic Programming.

    Google Scholar 

  144. Kalé, L. V. and Ramkumar, B. (1990). Joining AND Parallel Solutions in AND/OR Parallel Systems: Part I-Static Analysis. In ICLP '90.

    Google Scholar 

  145. Kalé, L. V., Ramkumar, B., and Shu, W. (1988). A Memory Organisation Independent Binding Environment for AND and OR Parallel Execution of Logic Programs. In ICLP '88, volume 2, University of Illinois at Urbana-Champaign.

    Google Scholar 

  146. Kalé, L. V. and Saletore, V. (1988). Obtaining first solution faster in parallel problem solving. Technical Report UIUCDCS-R-88-1481, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.

    Google Scholar 

  147. Kaplan, S. (1988). Algorithmic complexity of logic programs. In International Conference and Symposium on Logic Programming, pages 780–793, Seattle, WA.

    Google Scholar 

  148. Karam (1988). Prototyping Concurrent Systems with Multilog. Technical report, Department of Systems and Computer Engineering, Carleton University.

    Google Scholar 

  149. Kasif, S., Kohli, M., and Minker, J. (1983). PRISM: A Parallel Inference System for Problem Solving. In Logic Programming Workshop '83, pages 123–152, Lisboa, Portugal. Universidade Nova de Lisboa.

    Google Scholar 

  150. Kasif, S. and Minker, J. The Intelligent Channel: A Scheme for Result Sharing in Logic Programs. Technical report, University of Maryland.

    Google Scholar 

  151. Kasif, S., Reif, J. H., and Sherlekar, D. D. (1987). Formula Dissection: A Parallel Algorithm for Constraint Satisfaction. In IJCAI '87.

    Google Scholar 

  152. Kibler, D. and Conery, J. Parallelism in AI Programs. Technical report, Irvine Computational Intelligence Project, Information and Computer Science Department, University of California, Irvine.

    Google Scholar 

  153. Kimura, Y. and Chikayama, T. (1987). An Abstract KL1 Machine and its Instruction Set. Technical Report TR-246, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

    Google Scholar 

  154. Kliger, S., Yardeni, E., Kahn, K., and Shapiro, E. (1988). The Language FCP(:,?). In FGCS '88, pages 763–783, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  155. Knight, K. (1989). Unification: A multidisciplinary survey. A CM Computing Surveys, 21(1):93–124.

    Google Scholar 

  156. Kober, R., editor (1988). Parallelrechner-Architekturen. Springer, Berlin.

    Google Scholar 

  157. Kumar, V., Ramesh, K., and Rao, V. (1988). Parallel Best-First Search of State-Space Graphs: A Summary of Results. In AAAI '88, volume 1, pages 122–127.

    Google Scholar 

  158. Kumon, K., Masuzawa, H., Itashiki, A., Satoh, K., and Sohma, Y. (1986). Kabu-Wake: A New Parallel Inference Method and its Evaluation. IEEE, pages 168–172.

    Google Scholar 

  159. Kung, C.-H. (1985). High Parallelism and a Proof Procedure. Decision Support Systems, 1:323–331.

    Google Scholar 

  160. Kurfeß, F. (1988). Logic and reasoning with neural models (extended abstract). Neural Networks, 1, Suppl. 1 (Abstracts of INNS 88):192.

    Google Scholar 

  161. Kurfeß, F. (1990). Parallelism in Logic — Its Potential for Performance and Program Development. PhD thesis, Institut für Informatik, Technische Universität München, published as book by Vieweg Verlag, Wiesbaden (1991).

    Google Scholar 

  162. Kurfeß, F. (1991). Massive parallelism in inference systems. IJCAI '91 Workshop on Parallel Processing for Artificial Intelligence.

    Google Scholar 

  163. Kurfeß, F., Pandolfi, X., Belmesk, Z., Ertel, W., Letz, R., and Schumann, J. (1989). PARTHEO and FP2: Design of a parallel inference machine. In [Treleaven, 1989]. chapter 9.

    Google Scholar 

  164. Kurfeß, F. and Reich, M. (1989). Logic and reasoning with neural models. In Connectionism in Perspective, pages 365–376, Amsterdam. Elsevier.

    Google Scholar 

  165. Kurozumi, T. (1989). Outline of the fifth generation computer systems project and ICOT activities. Technical Report TR-523, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

    Google Scholar 

  166. Lake, T. (1988). Languages for Parallel Processing (Sprachen für die parallele Datenverarbeitung). Informationstechnik it, 30(2).

    Google Scholar 

  167. Lange, T. E. and Dyer, M. G. (1989). High-level inferencing in a connectionist network. Connection Science, 1:181–217.

    Google Scholar 

  168. Levi, G. (1986). Concurrency Issues in Logic Languages. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  169. Levi, G. and Palamidessi, C. (1988). Contributions to the Semantics of Logic Perpetual Processes. Acta Informatica, 25:691–711.

    Google Scholar 

  170. Levy, J. (1986a). CFL-A Concurrent Functional Language Embedded in a Concurrent Logic Programming Environment. Technical report, Weizmann Institute of Science, Rehovot, Israel.

    Google Scholar 

  171. Levy, J. (1986b). Shared Memory Execution of Committed-Choice Languages. In Conference On Logic Programming 86, pages 299–312.

    Google Scholar 

  172. Levy, J. and Friedmann, N. (1986). Concurrent Prolog Implementations — Two New Schemes. Technical report, Weizmann Institute of Science, Rehovot, Israel.

    Google Scholar 

  173. Li, G. and Wah, B. (1985). MANIP-2: A Multicomputer Architecture for Evaluating Logic Programs. IEEE, pages 123–130.

    Google Scholar 

  174. Lichtenwalder, K. (1988). Spezifikation einer parallelen Inferenzmaschine in Hinblick auf ein Transputersystem. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  175. Lin, Y.-J. and Kumar, V. (1988). An Execution Model for Exploiting AND-Parallelism in Logic Programs. New Generation Computing, 5:393–425.

    Google Scholar 

  176. Lusk, E., Butler, R., Disz, T., Olson, R., Overbeek, R., Stevens, R., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., Brand, P., Carlsson, M., Ciepielewski, A., and Haussmann, B. (1988). The AURORA OR-Parallel PROLOG System. In International Conference on Fifth Generation Computer Systems, pages 819–830.

    Google Scholar 

  177. Lütke-Holz, B. (1989). Simulation eines parallelen Hornklauselinterpreters nach dem Prinzip der Cooperative Competition. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  178. Mariyama, T. and Mariyama, T. et al. (1983). A Highly Parallel Inference Engine PIE. In Electronic Computer Society of IEEE of Japan, volume EC 83-39, Japan.

    Google Scholar 

  179. Matsuda, H. and Kokata, M. e. a. (1985). Parallel Prolog Machine PARK: Its Hardware Structure and Prolog System. In Conference on Logic Programming '85, pages 148–158.

    Google Scholar 

  180. Matsumoto, H. (1985). A Static Analysis of Prolog Programs. SIGPLAN Notices, 20(10):48–59.

    Google Scholar 

  181. Mayr, K. and Reich, M. (1988). Hochparallele Algorithmen für das Erfüllbarkeitsproblem in der Aussagenlogik — implementiert auf einem Simulator für neuronale Netze. Technical report, Institut für Informatik, Technische Universität München.

    Google Scholar 

  182. McCorduck, P. (1983). Introduction to the Fifth Generation. Communications of the ACM, 6(9):629–645.

    Google Scholar 

  183. Meseguer, J. (1990a). Conditional rewriting logic: Deduction, models and concurrency. Technical Report SRI-CSL-90-14, SRI International, Menlo Park, CA 94025.

    Google Scholar 

  184. Meseguer, J. (1990b). A logical theory of concurrent objects. Technical Report SRI-CSL-90-07, SRI International, Menlo Park, CA 94025.

    Google Scholar 

  185. Millroth, H. (1991). Reforming compilation of logic programs. In ILPS 91.

    Google Scholar 

  186. Mills, J. W. (1989). A pipelined architecture for logic programming with a complex but singlecycle instruction set. Technical Report TR 284, Computer Science Department, Indiana University, Bloomington, IN 47405.

    Google Scholar 

  187. Mills, J. W. (1990). Connectionist logic programming. Technical Report TR 315, Computer Science Department, Indiana University, Bloomington IN 47405.

    Google Scholar 

  188. Mills, J. W., Beavers, M. G., and Daffinger, C. A. (1990). Lukasiewicz logic arrays. Technical Report TR 296, Computer Science Department, Indiana University, Bloomington, IN 47405.

    Google Scholar 

  189. Mills, J. W. and Daffinger, C. A. (1990a). An Analog VLSI Array Processor for Classical and Connectionist AI. Technical Report TR 313, Computer Science Department, Indiana University, Bloomington, IN 47405.

    Google Scholar 

  190. Mills, J. W. and Daffinger, C. A. (1990b). CMOS VLSI Lukasiewicz Logic Arrays. Technical Report TR 312, Computer Science Department, Indiana University, Bloomington, IN 47405.

    Google Scholar 

  191. Minsky, M. (1990). Logical vs. analogical or symbolic vs. connectionist or neat vs. scruffy. In Frontiers of Artificial Intelligence, chapter 9, pages 218–243. MIT Press.

    Google Scholar 

  192. Moniz Pereira, L., Monteiro, L., and Cunha, Jose C.and Aparicio, J. (1988). Concurrency and Communication in Delta Prolog. In IEEE International Specialists Seminar on The Design and Applications of Parallel Digital Processors, pages 94–104, Lisbon.

    Google Scholar 

  193. Moto-Oka, T. and Fuchi, K. (1983). The architectures in the fifth generation computer. Information Processing.

    Google Scholar 

  194. Moto-Oka, T., Tanaka, H., Aida, H., Hirata, K., and Maruyama, T. (1984). The Architecture of a Parallel Inference Engine PIE. In Conference on Fifth Generation Computer Systems, pages 479–488. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  195. Muller, J.-P. (1984). Paralog: A Parallel Logic Programming System. In ECAI '86, pages 115–119. Elsevier.

    Google Scholar 

  196. Munsch, F. (1989). Ausnutzung von Parallelität bei Theorembeweisern durch Kooperation. Master's thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  197. Murakami, K., Kakuta, T., and Onai, R. (1984). Architectures and hardware systems: Parallel inference machine and knowledge base machine. Fifth Generation Computer Systems, pages 18–35.

    Google Scholar 

  198. Nilsson, M. and Tanaka, H. (1988). Massively Parallel Implementation of Flat GHC on the Connection Machine. In International Conference on Fifth Generation Computer Systems, pages 1031–1040.

    Google Scholar 

  199. NSF / ICOT (1990). NSF / ICOT Joint Workshop on Parallel Logic Programming and Knowledge Representation, Tokyo, Japan.

    Google Scholar 

  200. Ohki, M., Takeuchi, A., and Furukawa, K. (1987). An Object-oriented Language Based on the Parallel Logic Programming Language KL1. In Conference on Logic Programming '87, pages 894–909. MIT Press.

    Google Scholar 

  201. Onai, R., Asou, M., and Takeuchi, A. (1984). An approach to a parallel inference machine based on controldriven and data-driven mechanisms. Technical Report TR-042, Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  202. Onai, R. and et al. (May 1984). Analysis of Sequential Prolog Programs. Technical Report 48, Tokyo.

    Google Scholar 

  203. Onai, R., Shimizu, H., Masuda, K., Matsumoto, A., and Aso, M. Architecture and evaluation of a reduction-based parallel inference machine: Pim-r. Technical report, Institute for New Generation Computer Technology (ICOT), Tokyo.

    Google Scholar 

  204. Park, C.-I., Park, K. H., and Kim, M. (1988). Efficient Backward Execution in AND/OR Process Model. Information Processing Letters, 29:191–198.

    Google Scholar 

  205. Percebois, C., Signès, N., and Agnoletto, P. (1991). A compiler for a distributed inference model. In [Bode, 1991].

    Google Scholar 

  206. Pereira, L. and Nasr, R. (1984). Delta-Prolog: A Distributed Logic Programming Language. In International Conference On Fifth Generation Computer Systems, pages 283–291. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  207. Peterson, G. and Stickel, M. (1982). Complete Systems of Reductions Using Associative AND/OR Commutative Unifications. Technical report, SRI International, Menlo Park, CA.

    Google Scholar 

  208. Pinkas, G. (1990). Connectionist energy minimization and logic satisfiability. Technical report, Center for Intelligent Computing Systems, Department of Computer Science, Washington University.

    Google Scholar 

  209. Pinkas, G. (1991). Symmetric neural networks and propositional logic satisfiability. Neural Computation, 3(2):282–291.

    Google Scholar 

  210. Plaisted, D. (1984). The Occur-Check Problem in Prolog. New Generation Computing, 2:309–322.

    Google Scholar 

  211. Pollack, J. B. (1990). Recursive distributed representations. Artificial Intelligence, 46:77–105.

    Google Scholar 

  212. Ponder, C. and Patt, Y. (1984). Alternative Proposals for Implementing Prolog Concurrently and Implications Regarding their Respective Microarchitectures. In 17th Annual Microprogramming Workshop.

    Google Scholar 

  213. Potter, J. (1985). The Massively Parallel Processor. MIT Press.

    Google Scholar 

  214. Powers, D. M. W. (1990a). Compartmentalized Connection Graphs for Logic Programming I: Compartmentalization, Transformation and Examples. SEKI — Report SR-90-16, Fachbereich Informatik, Universität Kaiserslautern, D-6750 Kaiserslautern, Germany.

    Google Scholar 

  215. Powers, D. M. W. (1990b). Compartmentalized Connection Graphs for Logic Programming II: Parallelism, Indexing and Unification. SEKI — Report SR-90-17, Fachbereich Informatik, Universität Kaiserslautern, D-6750 Kaiserslautern, Germany.

    Google Scholar 

  216. Ramesh, R. and Ramakrishnan, I. (1990). Parallel tree pattern matching. Symbolic Computation, 9(4):704–716.

    Google Scholar 

  217. Ramesh, R., Verma, R., Krishnaprasad, T., and Ramakrishnan, I. (1989). Term matching on parallel computers. Logic Programming, pages 213–228.

    Google Scholar 

  218. Ramkumar, B. and Kalé, L. V. (1989a). Compiled Execution of the REDUCE-OR Process Model on Multiprocessors. In NACLP '89, pages 313–331.

    Google Scholar 

  219. Ramkumar, B. and Kalé, L. V. (1989b). On the Compilation of Parallel Prolog for Shared and Nonshared Memory Machines. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.

    Google Scholar 

  220. Ramkumar, B. and Kalé, L. V. (1990). A Chare Kernel Implementation of a Parallel Prolog Compiler. In Second Conference on Principles and Practice of Parallel Programming, Seattle.

    Google Scholar 

  221. Rapp, W. (1988). PEPSys Sequential Module on the MX-500 Users Manual. Technical Report PEPSys-26, European Computer Research Center (ECRC), München, München.

    Google Scholar 

  222. Ratcliffe, M. and Robert, P. (1986). PEPSys: A Prolog for Parallel Processing. Technical Report CA-17, European Computer Research Center (ECRC), München, München.

    Google Scholar 

  223. Ratcliffe, M. and Syre, J.-C. (1987). Virtual Machines for Parallel Architectures. Technical report, European Computer Research Center (ECRC), München, München.

    Google Scholar 

  224. Ringwood, G. (1988). Parlog86 and the Dining Logicians. Communications of the ACM, 31:10–25.

    Google Scholar 

  225. Rohmer, J., Gonzalez-Rubio, R., and Bradier, A. (1986). Delta driven computer: A parallel machine for symbolic processing. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  226. Safra, S. (1986). Partial Evaluation of Concurrent Prolog and its Implication. Technical Report CS86-24, Weizmann Institute of Science.

    Google Scholar 

  227. Saletore, V. A. and Kalé, L. V. (1990). Consistent Linear Speedups to a First Solution in Parallel State-Space Search. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign.

    Google Scholar 

  228. Saletore, V. A., Ramkumar, B., and Kalé, L. V. (1990). Consistent First Solution Speedups in OR-Parallel Execution of Logic Programs. Technical Report UIUCDCS-R-90-1586, Depart ment of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.

    Google Scholar 

  229. Saraswat, V. (1986). Problems with Concurrent Prolog. Technical Report CME-CS-86-100, Carnegie-Mellon University.

    Google Scholar 

  230. Schmid, E. (1988). Implementierung eines parallelen Theroembeweisers auf einem Multiprozessor-Simulator. Fortgeschrittenenpraktikum für Informatiker, Institut für Informatik, Technische Universität München, München.

    Google Scholar 

  231. Schumann, J. (1991). Efficient Theorem Provers based on an Abstract Machine. PhD thesis, Institut für Informatik, Technische Universität München.

    Google Scholar 

  232. Schumann, J. and Letz, R. (1990). PARTHEO: A High Performance Parallel Theorem Prover. In Stickel, M., editor, CADE '90, volume 449 of Lecture Notes in Computer Science, pages 40–56, Kaiserslautern. Springer.

    Google Scholar 

  233. Schumann, J., Letz, R., and Kurfeß, F. (1990). Tutorial on high-performance theorem provers: Efficient implementation and parallelization. In [Stickel, 1990].

    Google Scholar 

  234. Schwaab, F. and Tusera, D. (1988). Un Algorithme Distribue pour l'Execution Parallele de Prolog. Technical report, INRIA, Le Chesnay.

    Google Scholar 

  235. Shapiro, E. (1983). A Systolic Concurrent PROLOG Machine — Lecture notes on the Bagel. Technical Report TR-035, Institute for New Generation Computer Technology (ICOT), Tokyo.

    Google Scholar 

  236. Shapiro, E. (1984). Systolic Programming: A Paradigm of Parallel Processing. International Conference on Fifth Generation Computer Systems, pages 458–470.

    Google Scholar 

  237. Shapiro, E. (1986). Concurrent prolog: A progress report. Computer, 1986(8):44–58. also in [Bibel and Jorrand, 1986].

    Google Scholar 

  238. Shapiro, E. (1988). Concurrent Prolog. MIT Press.

    Google Scholar 

  239. Shapiro, E. (1989a). The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):413–510.

    Google Scholar 

  240. Shapiro, E. (1989b). Or-Parallel PROLOG in Flat Concurrent PROLOG. Logic Programming, (6):243–267.

    Google Scholar 

  241. Shapiro, E. and Takeuchi, A. (1983). Object-Oriented Programming in Concurrent Prolog. New Generation Computing, (1):25–48.

    Google Scholar 

  242. Shastri, L. (1988). A connectionist approach to knowledge representation and limited inference. Cognitive Science, 12:331–392.

    Google Scholar 

  243. Shastri, L. and Ajjanagadde, V. (1989). A connectionist system for rule based reasoning with multi-place predicates and variables. Technical report, University of Pennsylvania, Computer and Information Science Department, Philadelphia.

    Google Scholar 

  244. Shastri, L. and Ajjanagadde, V. (1990). From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings. Technical Report MS-CIS-90-05, Computer And Information Science Department, University of Pennsylvania, Philadelphia, PA 19104.

    Google Scholar 

  245. Shastri, L. and Feldman, J. A. (1985). Evidential Reasoning in Semantic Networks: A Formal Theory. In IJCAI '85, pages 465–474.

    Google Scholar 

  246. Shaw, D. (1981). NON-VON: A Parallel Machine Architecture for Knowledge Based Information Processing. In IJCAI '81, pages 961–963, Vancouver.

    Google Scholar 

  247. Shaw, D. (1987). On the range of applicability of an artificial intelligence machine. Artificial Intelligence, 32:252–172.

    Google Scholar 

  248. Shen, K. and Warren, D. (1987). A simulation study of the Argonne model for OR-parallel execution of Prolog. In Symposium on Logic Programming '87, pages 54–86.

    Google Scholar 

  249. Shrobe, H., Aspinall, J., and Mayle, N. (1988). Towards A Virtual Parallel Inference Engine. In AAAI '88, pages 654–659.

    Google Scholar 

  250. Singhal, A. (1990). Exploiting Fine Grain Parallelism in Prolog. PhD thesis, University of California, Berkeley. TR CSD 90/588.

    Google Scholar 

  251. Smolensky, P. (1987). On variable binding and the representation of symbolic structures in connectionist systems. CU-CS 355-87, Department of Computer Science and Institute of Cognitive Science, University of Colorado.

    Google Scholar 

  252. Sohma, Y., Satoh, K., Kumon, K., Masuzawa, H., and Itashiki, A. (1985). A new parallel inference mechanism based on sequential processing. In IFIP TC-10 Working Conference on Fifth Generation Computer Architecture, UMIST, Manchester.

    Google Scholar 

  253. Stanfill, C. (1988). Parallel computing for information retrieval. Technical Report DR88-1, Thinking Machines Corporation, Cambridge, MA.

    Google Scholar 

  254. Stanfill, C. and Waltz, D. (1986). Toward Memory-Based Reasoning. Communications of the ACM, 29:1213–1228.

    Google Scholar 

  255. Stanfill, C. and Waltz, D. (1988a). Artificial intelligence on the connection machine: A snapshot. Technical Report G88-1, Thinking Machines Corporation, Cambridge, MA.

    Google Scholar 

  256. Stanfill, C. and Waltz, D. (1988b). The memory-based reasoning paradigm. In Case-Based Reasoning Workshop, pages 414–424, Clearwater Beach, FL.

    Google Scholar 

  257. Stender, J. (1987). Parallele Prolog-Implementierung auf Transputern. Hard and Soft, Juli/August 87:17–23.

    Google Scholar 

  258. Stern, A. (1988). Matrix Logic. North Holland, Amsterdam.

    Google Scholar 

  259. Stickel, M., editor (1989). 1989 AAAI Spring Symposium on Representation and Compilation in High Performance Theorem Proving. SRI International.

    Google Scholar 

  260. Stickel, M., editor (1990). CADE '90: 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, Kaiserslautern. Springer.

    Google Scholar 

  261. Stolcke, A. (1989). Unification as constraint satisfaction in structured connectionist networks. Neural Computation, (1):559–567.

    Google Scholar 

  262. Stolcke, A. and Wu, D. (1991). Tree matching with recursive distributed representations. International Computer Science Institute.

    Google Scholar 

  263. Stolfo, S. (1983). The DADO Parallel Computer. Technical report, Department of Computer Science, Columbia University, New York.

    Google Scholar 

  264. Stolfo, S. (1987a). Initial Performance of the DADO-2 Prototype. Computer, 20:75–85.

    Google Scholar 

  265. Stolfo, S. (1987b). On the Limitations of Massively Parallel (SIMD) Architectures for Logic Programming. In US-Japan AI Symposium.

    Google Scholar 

  266. Stolfo, S., Miranker, D., and Shaw, D. (1983). Architecture and applications of DADO: A large-scale parallel computer for artificial intelligence. In IJCAI '83, pages 850–854, Karlsruhe, BRD.

    Google Scholar 

  267. Succi, G. and Marino, G. (1991). Data Parallelism in Logic Programming. In [ICLP91, 1991].

    Google Scholar 

  268. Syre, J.-C. (1985). A Review of Computer Architectures for Functional and Logic Programming Systems. Technical report, European Computer Research Center (ECRC), München.

    Google Scholar 

  269. Syre, J.-C. and Westphal, H. (1985). A Review of Parallel Models for Logic Programming Languages. Technical report, European Computer Research Center (ECRC), München.

    Google Scholar 

  270. Szeredi, P. (1989). Performance Analysis of the Aurora OR-parallel Prolog System. In North American Conference on Logic Programming.

    Google Scholar 

  271. Takeuchi, A. and Furukawa, K. (1985). Interprocess Communication in Concurrent Prolog. Technical report, Institute for New Generation Computer Technology (ICOT), Tokyo.

    Google Scholar 

  272. Takeuchi, A. and Furukawa, K. (1986). Parallel Logic Programming Languages. In Third International Conference On Logic Programming '86, pages 242–254.

    Google Scholar 

  273. Takeuchi, A., Takahashi, K., and Shimizu, H. (1987). A Description Language with AND/OR Parallelism for Concurrent Systems and Its Stream-Based realization. Technical report, Institute for New Generation Computer Technology, Tokyo.

    Google Scholar 

  274. Tamaki, H. (1985). A Distributed Unification Scheme for Systolic Logic Programs, pages 552–559. IEEE.

    Google Scholar 

  275. Tamura, N. and Kanada, Y. (1984). Implementing Parallel Prolog on a Multiprocessor Machine. In International Symposium On Logic Programming '84, Atlantic City, NJ.

    Google Scholar 

  276. Tanaka, J. (1988). Meta-interpreters and Reflective Operations in GHC. In Future Generation Computer Systems, pages 775–783, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  277. Taylor, S. (1989). Parallel Logic Programming Techniques. Prentice Hall.

    Google Scholar 

  278. Taylor, S., Maio, C., Stolfo, S., and Shaw, D. (1983). Prolog on the DADO Machine: A Parallel System for High-speed Logic Programming. Technical report, Department of Computer Science, Columbia University, New York.

    Google Scholar 

  279. Tick, E. (1988). Compile-time granularity analysis for parallel logic programming languages. In International Conference on Fifth Generation Computer Systems, pages 994–1000, Tokyo, Japan.

    Google Scholar 

  280. Tick, E. and Warren, D. (1984). Towards a Pipelined Prolog Processor. New Generation Computing, 2:323–345.

    Google Scholar 

  281. Touretzky, D. and Hinton, G. (1985). Symbols Among the Neurons: Details of a Connectionist Inference Architecture. In IJCAI '85, pages 238–243, Pittsburgh.

    Google Scholar 

  282. Touretzky, D. S. and Hinton, G. E. (1988). A distributed connectionist production system. Cognitive Science, 12:423–466.

    Google Scholar 

  283. Treleaven, P. C., editor (1989). Parallel Computers: Object-Oriented, Functional and Logic. Wiley, Chichester.

    Google Scholar 

  284. Treleaven, P. C. and Refenes, A. N. (1985). Fifth Generation and VLSI Architectures. Future Generation Computer Systems, 1(6):387–396.

    Google Scholar 

  285. Treleaven, P. C., Refenes, A. N., Lees, K., and McCabe, S. (1987). Computer Architectures for Artificial Intelligence. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  286. Treleaven, P. C., Refenes, A. N., Lees, K. J., and Mccabe, S. C. (1986). Computer Architectures for Artificial Intelligence. Technical report, University College, London; Ferranti Computer Systems, Bracknell; THORN-EMI Central Research Labs., Hayes.

    Google Scholar 

  287. Treleaven, P. C. and Vanneschi, M., editors (1987). Future Parallel Computers, volume 272 of Lecture Notes in Computer Science, Berlin. Springer.

    Google Scholar 

  288. Uchida (1983). Inference Machine: From Sequential to Parallel. In 10th Annual International Symposium On Computer Architecture, Schweden.

    Google Scholar 

  289. Uchida, S. Inference Machines in FCGS Project. Technical Report TR-278, Institute for New Generation Computer Technology, Tokyo.

    Google Scholar 

  290. Uchida, S. (1987). Parallel Inference Machines at ICOT. Future Generation Computer Systems, (3):245–252.

    Google Scholar 

  291. Uchida, S., Uchida, K., Uchida, T., Goto, A., Nakajima, K., Nakashima, H., Yokota, M., Nishikawa, H., Yamamoto, A., and Mitsui, M. (1986). Logic Computers and Japan's FGCS Project. In [Treleaven and Vanneschi, 1987].

    Google Scholar 

  292. Uchida, S., Taki, K., Nakajima, K., Goto, A., and Chikayama, T. (1988). Research and Development of the Parallel Inference Systemin the Intermediate Stage of the FGCS Project. In International Conference on Fifth Generation Computer Systems, pages 17–36, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  293. Ueda, K. (1985). Guarded Horn Clauses. Technical Report TR-103, Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  294. Ueda, K. (1986). Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. Technical Report TR-208, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

    Google Scholar 

  295. Ueda, K. (1989). Parallelism in logic programming. Technical Report TR-495, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

    Google Scholar 

  296. Ultsch, A., Hannuschka, R., Hartmann, U., and Weber, V. (1990). Learning of control knowledge for symbolic proofs with backpropagation networks. In [Eckmiller et al., 1990], pages 499–502.

    Google Scholar 

  297. Vitter, J. and Simons, R. (1986). New classes for parallel complexity:. IEEE Transactions on Computers, 35(5):403–418.

    Google Scholar 

  298. Wah, B. (1987). New Computers for Artificial Intelligence Processing. Computer, 20:10–19.

    Google Scholar 

  299. Waltz, D. L. (1990). Massively Parallel AI. In Ninth National Conference on Artificial Intelligence, Boston, MA. American Association for Artificial Intelligence.

    Google Scholar 

  300. Waltz, D. L. and Stanfill, C. (1988a). Artificial Intelligence Related Research on the Connection Machine. In International Conference on Fifth Generation Computer Systems, pages 1010–1024, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  301. Waltz, D. L. and Stanfill, C. (1988b). Artificial Intelligence Related Research on the Connection Machine. In International Conference on Fifth Generation Computer Systems, pages 1010–1024, Tokyo. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  302. Wang, J. (1989). Towards a New Computational Model for Logic Languages. Technical report, Department of Computer Science, University of Essex, Colchester.

    Google Scholar 

  303. Wang, J., Marsh, A., and Lavington, S. (1990). Non-WAM Models of Logic Programming and their Support by Novel Parallel Hardware. International Workshop on Massively Parallel Inference Systems.

    Google Scholar 

  304. Warren, D. (1987). The SRI model for OR-parallel execution of Prolog. In Symposium on Logic Programming '87, pages 92–102.

    Google Scholar 

  305. Warren, D. H. (1983). An Abstract Prolog Instruction Set. Technical Report 309, SRI International, Artificial Intelligence Center, Menlo Park, California.

    Google Scholar 

  306. Watzlawik, G. (1991). European Declarative System (EDS): Architecture and Interprocess Communication. In [Bode, 1991], pages 485–494.

    Google Scholar 

  307. Weinbaum, D. and Shapiro, E. (1986). Hardware Description and Simulation Using Concurrent Prolog. Technical Report CS86-25, Weizmann Institute of Science, Rehovot, Israel.

    Google Scholar 

  308. Westphal, H. (1986). Eine Beurteilung paralleler Modelle für Prolog. In GI-Jahrestagung '86, pages 227–240, Berlin. Springer.

    Google Scholar 

  309. Westphal, H., Robert, P., Chassin, J., and Syre, J. (1987). The PEPSys model: Combining Backtracking, AND-and OR-parallelism. In Symposium on Logic Programming '87, pages 436–448.

    Google Scholar 

  310. Yamaguchi, T., Tezuka, Y., and Kakusho, O. Parallel Processing of Resolution. Technical report, Osaka University.

    Google Scholar 

  311. Yang, R. (1987). P-Prolog — A Parallel Logic Programming Language. World Scientific, Singapore.

    Google Scholar 

  312. Yasuura, H. (1984). On Parallel Computational Complexity of Unification. In International Conference on Fifth Generation Computer Systems, pages 235–243. Institute for New Generation Computer Technology (ICOT).

    Google Scholar 

  313. Zhiyi, H. and Shouren, H. (1990). A compiling approach for exploiting AND-parallelism in logic programs. Future Generation Computer Systems, 1(1):35–42.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Science Institute, 1947 Center Street, 94704, Berkeley, CA, USA

    Franz Kurfeß

Authors
  1. Franz Kurfeß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Fronhöfer G. Wrightson

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurfeß, F. (1992). Potentiality of parallelism in logic. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-55425-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics