Skip to main content
SpringerLink
Log in

An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture

  • Conference paper
  • First Online:
Book cover Logical Foundations of Computer Science — Tver '92 (LFCS 1992)

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

Included in the following conference series:

  • 140 Accesses

Abstract

Several abstract models have already been proposed for parallel logic programming, but the actual developments are essentially sequential simulations, often based on monoprocessor systems; this is widely due to the fact that the problem encounters fundamental limits. This paper describes a cooperative scheme between Prolog interpreters, based on the And-parallelism opportunities of logical programming. The scheme has recently been implemented on a Transputer-based architecture. with the Parallel language. The grain of parallelism is medium-sized, to fit the message-passing characteristic of the architecture and the choice of the interpretative way.

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.

References

  1. H.Ait Kaci. “Warren Abstract Machine: a tutorial reconstruction”. 8 th International Conference on Logic Programming” ICLP'91. Paris. 1991.

    Google Scholar 

  2. M.Bruynooghe & al. The memory management of Prolog implementation. in Workshop'80.

    Google Scholar 

  3. M.Carlson & K.Danhof & R.Ouerbeek. “A simplified approch to the implementation of AND parallelism in an OR parallel environment” Logic programming, proceeding of the 5th international conference. Seatle 88.

    Google Scholar 

  4. M.Cannataro & al. A Highly Decentralized Architecture for the Parallel execution of Logic Programs. Proceedings — Conference on distributed systems. Lyon, décembre 89.

    Google Scholar 

  5. J.Chassin De Kergommeaux & P.Codognet & J.C.Syre. “Revues des modèles de programmation logique parallèle” Journées de synthèse AFCET. Paris 01/89

    Google Scholar 

  6. K.Clark & S.Gregory. PARLOG: Parallel Programming In Logic. ACM Transactions on Programming Languages on Systems, January, 1986.

    Google Scholar 

  7. J.S.Conery, D.F.Kibler. Parallel interpretation of logics-programs in Proc.conf.on.functional programing languages and computer architecture, ACM, Octobre 1981.

    Google Scholar 

  8. J.S.Conery, D.S.Kibler, “ And parallelism and non-determinism in logic programs”; New generation computing n. 3. 1985.

    Google Scholar 

  9. P.Deransart & G.Ferrand “Programmation en logique: Méthodolgie et enseignement”. Actes du séminaire CNET de Trégastel, Mai 1986.

    Google Scholar 

  10. D.Degroot. Restricted And-Parallel and Side Effects. In 4 th Symposium on Logic Programming. San Francisco, Sep 87.

    Google Scholar 

  11. J.Ferber.“objet et agents: une étude des structures de représentation et de communication en intelligence artificielle”, thèse d'état Juin 89.

    Google Scholar 

  12. H.Gallaire. Multiple reasoning styles in logic programming. “proceedings — conference FGCS'88 (Futur generation computing system)-Tokyo (ICOT).

    Google Scholar 

  13. A.Goto. Research and development of the parallel inference machine in FGCS project. Parallel Processing & Intelligence Artificial. Willey. Communicating Process Architecture. 1989

    Google Scholar 

  14. S.Gregory. “Parallel programming in PARLOG” Addison Wesley 87.

    Google Scholar 

  15. A.Gup. “ Parallelism in production system” Research notes in Artificial intelligence, Pitman Ed.87.

    Google Scholar 

  16. U.Glasser & al. Flat Concurrent Prolog on Transputers. Proceedings — Conference on distrubuted systems. Lyon, décembre 89.

    Google Scholar 

  17. C.Hewitt. “offices are open systems” readings in Distributed artificial intelligence Morgan kaufman publishers, INC.

    Google Scholar 

  18. M.V.Hermenegildo, “ Efficient Management of Backtracking in And-Parallelism ”, Third international on logic programming (London 86).

    Google Scholar 

  19. M.V.Hermenegildo, An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs. Third international confernce on logic programming (London 86).

    Google Scholar 

  20. P.Kacsuk. “Prolog implementation for cellular architecture ” Fourth International Workshop on parallel processing by cellular automata, Berlin Oct 88. Springer verlag LNCS n∘ 342 p131.

    Google Scholar 

  21. P.Kacsuk & I.Futo. Multi-transputer implementation of CS-Prolog. Parallel Processing & Intelligence Artificial. Willey. Communicating Process Architecture. 1989

    Google Scholar 

  22. Kowalski. “Predicate logic as programmaing language” inforamtion processing 74, Stockholm; 569–574.

    Google Scholar 

  23. Parallel 3L LTD, User guide.

    Google Scholar 

  24. J.A.Robinson. “A machine-oriented logic based on the resolution principle”. JACM 12, (Janvier 1965), pages 23–41.

    Google Scholar 

  25. K.Sadi & F.Meunier. “ Coopération d'interpréteurs Prolog à base de Transputers” Congrès Canadien en Génie Electrique et informatique. Septembre 91, Québec, Canada.

    Google Scholar 

  26. E.Shapiro. “Concurrent PROLOG” ICOT 1983.

    Google Scholar 

  27. E.Shapiro. The concurrent prolog. Advanced Programming Techniques (MIT Press), 1986.

    Google Scholar 

  28. K.Ueda. “Guarded Horn Clauses” Technical Report TR-103, ICOT june, 1985.

    Google Scholar 

  29. M.Van Caneghem. “Anatomie de PROLOG”. InterEdition 1986.

    Google Scholar 

  30. D.H.Warren & al. “ the ANDORRA_I processor supporting full prolog on the basic ANDORRA Model. ICLP91. Juin 91, Paris.

    Google Scholar 

  31. D.H.Warren & al. “ The ANDORRA_Engine: a parallel implementation of the basic ANDORRA Model”. ICLP91. juin 91, Paris.

    Google Scholar 

  32. H.Westphal & al. The PEPSYS Model: combining backtracking, AND-and OR-parallelism. in 4th Symposium on logic programming, San Fransisco, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut National des Télécommunications, 9 rue C. Fourier, 91011, Evry, France

    K. Sadi & F. Meunier

Authors
  1. K. Sadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Meunier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sadi, K., Meunier, F. (1992). An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023894

Download citation

  • DOI: https://doi.org/10.1007/BFb0023894

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation