Dataflow programs for parallel computations of logic programs and their semantics

  • Susumu Yamasaki
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 366)


This paper deals with a method of constructing a dataflow program computing a given logic program in parallel. The dataflow program for a given logic program is a recursion equation set expressing the sequences of answer substitutions provided by the finite computation of the original logic program. It is defined over a sequence domain, which is the set of all finite and infinite sequences of substitutions. It is shown that the recursion equation set defines a continuous function from a direct product of a sequence domain to itself, therefore there exists a least fixpoint of the function. The fixpoint completely denotes the answer set for a parallel computation of the original logic program. In this sense, the fixpoint is interpreted as a semantics of the logic program.

Key Words

Dataflow Semantics for fair nodeterminism Parallel computation of logic programs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nait. M. A. Abdallah, On the interpretation of infinite computations in logic programming, Lecture Notes in Computer Science 172 (1984) 358–370.Google Scholar
  2. 2.
    K.P. Apt and M.H. van Emden, Contributions to the theory of logic programming, J. ACM 29 (1982) 841–864.Google Scholar
  3. 3.
    E.A. Ashcroft and W.W. Wadge, Lucid-A formal system for writing and proving programs, SIAM J. Computing 5 (1976) 336–354.Google Scholar
  4. 4.
    M.Baudinet, Proving termination properties of PROLOG programs: A semantic approach, Research Report STAN-CS-88-1202, Computer Science Dept., Stanford University (1988).Google Scholar
  5. 5.
    M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733–742.Google Scholar
  6. 6.
    M. Fitting, A deterministic Prolog fixpoint semantics, J. of Logic Programming 2 (1985) 111–118.Google Scholar
  7. 7.
    M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 2 (1985) 295–312.Google Scholar
  8. 8.
    G. Frauden, Logic programming and substitutions, Lecture Notes in Computer Science 199 (1985) 146–158.Google Scholar
  9. 9.
    G. Kahn, The semantics of a simple language for parallel programming, Proc. IFIP 74 (1974) 471–475.Google Scholar
  10. 10.
    J.L. Lassez and M.J. Maher, Closures and fairness in the semantics of programming logic, Theoretical Computer Science 29 (1984) 167–184.Google Scholar
  11. 11.
    J.L. Lassez and M.J. Maher, Maximal fixpoints of logic programs, Theoretical Computer Science 39 (1985) 15–25.Google Scholar
  12. 12.
    D. Park, The ‘fairness’ problem and nondeterministic computing networks, in: de Bakker and van Leeuwen, eds., Foundations of Computer Science IV (Mathematisch Centrum, Amsterdam, 1983) 133–161.Google Scholar
  13. 13.
    W.W. Wadge, An extensional treatment of dataflow deadlock, Lecture Notes in Computer Science 70 (1979) 285–299.Google Scholar
  14. 14.
    S. Yamasaki et al., A fixpoint semantics of Horn sentences based on substitution sets, Theoretical Computer Science 51 (1987) 309–324.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Susumu Yamasaki
    • 1
  1. 1.Department of Information TechnologyOkayama UniversityOkayamaJapan

Personalised recommendations