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.
This research was done while the author was at: Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005.
We thank Melvin Fitting and R.K.Shyamasundar for discussions, P.S.Thiagarajan and the referees for comments and T.V.Vasudevan for typing the manuscript.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
Apt K.R. and M.H. van Emden, Contributions to the Theory of Logic Programming, Journal of the ACM, 29: 841–862, 1982.
Clark K.L. and S. Gregory, PARLOG: Parallel Programming in Logic, ACM Transactions on Programming Languages and Systems, 8: 1–49, 1986.
Conery J.S. and D.F. Kibler, AND — Parallelism and Nondeterminism in Logic Programs, New Generation Computing, 3: 43–70, 1985.
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.
Falaschi M, G. Levi and C. Palamidessi, Synchronization Logic: axiomatics and formal semantics of Generalized Horn Clauses, Information and Control, 60: 36–69, 1984.
Fitting M, A. Kripke-Kleene semantics for logic programs, Journal of Logic Programming, 4: 295–312, 1985.
Francez N, D. Lehmann and A. Pnueli, A linear history semantics for languages for distributed programming, Theoretical Computer Science, 32: 25–46, 1984.
Hoare C.A.R. Communicating Sequential Processes, Communications of the ACM, 21: 666–677, 1978.
Lassez J-L and M.J. Maher, Closures and Fairness in the Semantics of Programming Logic, Theoretical Computer Science, 29: 167–184, 1984.
Lindstrom G. and P. Panangaden, Stream based execution of logic Programs, Proc. of the Intl. Symp. on Logic Programming, Atlantic City, 168–176, 1984.
Lloyd, J.W. Foundations of Logic Programming, Springer-Verlag, New York, 1984.
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.
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.
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.
Shapiro, E. A subset of Concurrent Prolog and its interpretor, Tech. Rep. TR-003, ICOT, Tokyo, 1983.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramanujam, R. (1987). Semantics of distributed Horn clause programs. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_60
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive