论文信息 - Semantics of Distributed Horn Clause Programs

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.

Ramaswamy Ramanujam | R. Ramanujam

[1] Amir Pnueli,et al. A Linear-History Semantics for Languages for Distributed Programming , 1984, Theor. Comput. Sci..

[2] Michael J. Maher,et al. Closures and Fairness in the Semantics of Programming Logic , 1984, Theor. Comput. Sci..

[3] Keith L. Clark,et al. PARLOG: parallel programming in logic , 1986, ACM Trans. Program. Lang. Syst..

[4] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[5] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[6] Melvin Fitting,et al. A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[7] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[8] Luís Moniz Pereira,et al. Delta-Prolog: A Distributed Logic Programming Language , 1984, FGCS.

[9] Giorgio Levi,et al. A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses , 1984, Inf. Control..

[10] Laxmikant V. Kalé,et al. Executing Distributed Prolog Programs on a Broadcast Network , 1984, International Conference on Spoken Language Processing.

[11] Prakash Panangaden,et al. Stream-Based Execution of Logic Programming , 1984, SLP.

[12] R. K. Shyamasundar,et al. Process Specification of Logic Programs , 1984, FSTTCS.

[13] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.