Skip to main content

Design and implementation of a parallel inference machine for first order logic: an overview

  • Conference paper
  • First Online:
PARLE Parallel Architectures and Languages Europe (PARLE 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 258))

Abstract

Several approaches to parallel architectures and languages for advanced information processing are being investigated within ESPRIT Project 415. This overview presents one of these approaches, carried out in one subproject of ESPRIT 415 ("Subproject F"), which aims at the design and implementation of a parallel inference machine.

  • -This machine, called LCM, for Logical Connection Machine, will be a highly parallel system for problem solving, mostly directed toward symbolic processing and artificial intelligence applications. It is based on the "connection method", which is a deductive inference technique for first order logic with significant possibilities for introducing parallelism.

  • -The design of such a complex system requires the use of formal means. The abstract specification of the LCM architecture reflects the parallel algorithmic description of the connection method and is expressed with FP2, a "Functional and Parallel Programming" language based on term rewriting techniques. Formal treatment and systematic transformations can be applied to FP2 programs.

  • -The actual implementation of the LCM requires a highly parallel multi-processor machine. Once such a machine is chosen, systematic transformations of FP2 programs can be applied for mapping the abstract process structure of the LCM specification onto the concrete processor structure of the machine.

This paper is an informal introduction to the bases of this work. It presents the main ideas and design decisions of the project through a series of simple examples.

This research is partially funded by ESPRIT Project 415 : Parallel Architectures and Languages for Advanced Information Processing — A VLSI-Directed Approach.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspetsberger K. Substitution expressions: extracting solutions of non-Horn clause proofs. In Proc. of EUROCAL 85, Linz, Austria, LNCS 204, p. 78–86, Springer-Verlag, 1985.

    Google Scholar 

  2. Aspetsberger K., Bayerl S. Two parallel versions of the connection method for propositional logic on the L-Machine. In Proc. of the German Workshop on Artificial Intelligence, Dassel/Solling, Informatik-Fachberichte, Springer-Verlag, 1985.

    Google Scholar 

  3. Bibel W. Automated theorem proving. Vieweg Verlag, Braunschweig, 1982; second edition 1987.

    Google Scholar 

  4. Bibel W.. Matings in matrices. CACM 26, p. 844–852, 1983.

    Google Scholar 

  5. Bibel W., Aspetsberger K. A bibliography on parallel inference machines. Journal of Symbolic Computation, Vol. 1 No. 1, p. 115–118, 1985.

    Google Scholar 

  6. Bibel W., Jorrand Ph. (Ed.) Fundamentals of artificial intelligence. An advanced course. ACAI 85, LNCS 232, Springer-Verlag, 1986.

    Google Scholar 

  7. Buchberger B. The L-Machine: an attempt at parallel hardware for symbolic computation. In Proc. of AAEECC 3, Grenoble, France, LNCS 229, Springer-Verlag, 1985.

    Google Scholar 

  8. Eder E. An implementation of a theorem prover based on the connection method. In Proc. of AIMSA 84, Varna, Bulgaria, North-Holland, p. 121–128, 1985.

    Google Scholar 

  9. Hufflen JM. Un exemple d'utilisation de FP2: description d'une architecture parallèle et pipe-line pour l'unification. RR LIFIA 43, Grenoble, 1986.

    Google Scholar 

  10. Jorrand Ph. FP2: Functional Parallel Programming based on term substitution. In Proc. of AIMSA 84, Varna, Bulgaria, North-Holland, p. 95–112, 1984.

    Google Scholar 

  11. Jorrand Ph. Term rewriting as a basis for the design of a functional and parallel programming language. A case study: the language FP2. In ACAI 85, LNCS 232, Springer-Verlag, p. 221–276, 1986.

    Google Scholar 

  12. Marty A. Placement d'un réseau de processus communicants décrit en FP2 sur une structure de grille en vue d'une implantation de ce language. RR LIFIA 49, Grenoble, 1986.

    Google Scholar 

  13. Marty JC. Un environnement de programmation pour le language FP2. RI LIFIA, Grenoble, 1986.

    Google Scholar 

  14. May D. Occam programming manual. Prentice-Hall International, 1984.

    Google Scholar 

  15. Milner R. A calculus of communicating systems. LNCS 92, Springer-Verlag, 1980.

    Google Scholar 

  16. Pereira JM. Processus communicants: un language formel et ses modèles. Problèmes d'analyse. Doctoral Thesis, LIFIA, INPG, Grenoble, 1984.

    Google Scholar 

  17. Rogé S. Comparaison des comportements de processus communicqnts. Application au language FP2. Doctoral Thesis, LIFIA, INPG, Grenoble, 1986

    Google Scholar 

  18. Schnoebelen Ph. The semantics of concurrency in FP2. In Working Group on Semantics, ESPRIT Project 415, 1985.

    Google Scholar 

  19. Schnoebelen Ph. μFP2: a prototype interpreter for FP2. RR LIFIA 41, Grenoble, 1986.

    Google Scholar 

  20. Schnoebelen Ph. About the implementation of FP2. RR LIFIA 42, Grenoble, 1986.

    Google Scholar 

  21. Schnoebelen Ph. Rewriting techniques for the temporal analysis of communicating processes. To appear, 1986.

    Google Scholar 

  22. Schnoebelen Ph., Schaefer P. Specification of a pipe-lined event driven simulator. To appear, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. W. de Bakker A. J. Nijman P. C. Treleaven

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jorrand, P. (1987). Design and implementation of a parallel inference machine for first order logic: an overview. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_143

Download citation

  • DOI: https://doi.org/10.1007/3-540-17943-7_143

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17943-6

  • Online ISBN: 978-3-540-47144-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics