Semantics of distributed Horn clause programs
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.
KeywordsLogic Program Function Symbol Operational Semantic Component Program Communicate Sequential Process
Unable to display preview. Download preview PDF.
- Conery J.S. and D.F. Kibler, AND — Parallelism and Nondeterminism in Logic Programs, New Generation Computing, 3: 43–70, 1985.Google Scholar
- Fitting M, A. Kripke-Kleene semantics for logic programs, Journal of Logic Programming, 4: 295–312, 1985.Google Scholar
- 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
- Lloyd, J.W. Foundations of Logic Programming, Springer-Verlag, New York, 1984.Google Scholar
- 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
- 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
- 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
- Shapiro, E. A subset of Concurrent Prolog and its interpretor, Tech. Rep. TR-003, ICOT, Tokyo, 1983.Google Scholar
- 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