Advertisement

Semantics of distributed Horn clause programs

  • R. Ramanujam
Session 6 Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)

Abstract

We study the semantics of a Horn clause program distributed over a fixed finite number of sites. We present a least fixed-point characterisation and then describe the operational semantics using refutation trees.

Keywords

Logic Program Function Symbol Operational Semantic Component Program Communicate Sequential Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Apt K.R. and M.H. van Emden, Contributions to the Theory of Logic Programming, Journal of the ACM, 29: 841–862, 1982.CrossRefGoogle Scholar
  2. Clark K.L. and S. Gregory, PARLOG: Parallel Programming in Logic, ACM Transactions on Programming Languages and Systems, 8: 1–49, 1986.CrossRefGoogle Scholar
  3. Conery J.S. and D.F. Kibler, AND — Parallelism and Nondeterminism in Logic Programs, New Generation Computing, 3: 43–70, 1985.Google Scholar
  4. van Emden M.H. and R.A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM, 23: 733–742, 1976.CrossRefGoogle Scholar
  5. Falaschi M, G. Levi and C. Palamidessi, Synchronization Logic: axiomatics and formal semantics of Generalized Horn Clauses, Information and Control, 60: 36–69, 1984.CrossRefGoogle Scholar
  6. Fitting M, A. Kripke-Kleene semantics for logic programs, Journal of Logic Programming, 4: 295–312, 1985.Google Scholar
  7. Francez N, D. Lehmann and A. Pnueli, A linear history semantics for languages for distributed programming, Theoretical Computer Science, 32: 25–46, 1984.CrossRefGoogle Scholar
  8. Hoare C.A.R. Communicating Sequential Processes, Communications of the ACM, 21: 666–677, 1978.CrossRefGoogle Scholar
  9. Lassez J-L and M.J. Maher, Closures and Fairness in the Semantics of Programming Logic, Theoretical Computer Science, 29: 167–184, 1984.CrossRefGoogle Scholar
  10. Lindstrom G. and P. Panangaden, Stream based execution of logic Programs, Proc. of the Intl. Symp. on Logic Programming, Atlantic City, 168–176, 1984.Google Scholar
  11. Lloyd, J.W. Foundations of Logic Programming, Springer-Verlag, New York, 1984.Google Scholar
  12. Pereira, L.M. and R. Nasr, Delta-Prolog: A Distributed Logic Programming Language, Proc. of the Intl. Conf. on Fifth Generation Systems, Tokyo, 263–290, 1984.Google Scholar
  13. Ramanujam R. and R.K. Shyamasundar, Process Specification of Logic Programs, Proc. FST and TCS 4, Springer Lecture Notes in Computer Sciences 181, 31–43, 1984.Google Scholar
  14. Ramanujam R. Theories and Models of Distributed Logic Programs, Ph.D. Thesis submitted to the University of Bombay, Tata Institute of Fundamental Research, Bombay, 1987.Google Scholar
  15. Shapiro, E. A subset of Concurrent Prolog and its interpretor, Tech. Rep. TR-003, ICOT, Tokyo, 1983.Google Scholar
  16. Warren D.S., M. Ahamad, S.K. Debray and L.V. Kale, Executing distributed Prolog Programs on a broadcast network, Proc. of the Intl. Symp. on Logic Programming, Atlantic City, 12–21, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • R. Ramanujam
    • 1
  1. 1.The Institute of Mathematical SciencesC.I.T. CampusMadras

Personalised recommendations