Parallel Logic Programming using the Linda Model of Computation

   page       BibTeX_logo.png   
Paolo Ciancarini
Jean Pierre Banâtre, Daniel Le Métayer (eds.)
Research Directions in High-Level Parallel Programming Languages, pages 110-125
Lecture Notes in Computer Science 574
Springer Berli

In this paper we study the relationship between Linda programming and parallel logic programming. We define PoliSpaces (PoliS) as an extension of Linda with Multiple Tuple Spaces. PoliS is introduced as a framework for designing multiparadigm systems, i.e., systems where code written in different languages can coexist. Our first test for PoliS is logic programming. We describe syntax and semantics of PoliS Prolog, a new parallel logic language based on PoliS. A parallel semantics for PoliS Prolog is given defining a multilevel abstract machine based on a chemical interpretation of the basic logic programming execution mechanism. The multilevel abstract machine is the basis for an implementation where the key idea consists of introducing a meta tuple space as a communication kernel across different tuple spaces.