P-Prolog: A parallel logic language based on exclusive relation

AbstractThis paper presents a parallel logic programming language named P-Prolog which is being developed as a logic programming language featuring both and- and or-parallelism. Compared with the other parallel logic programming languages, syntactic constructs such as read-only annotation,6) mode declaration2) and communication constraints7) are not used in P-Prolog. A new concept introduced in P-Prolog is the exclusive relation of guarded Horn clauses. Advances included in P-prolog. are:(1)The synchronization mechanism can determine the direction of data flow dynamically.(2)Guarded Horn clauses can be interpreted as eitherdon’t care nondeterminism ordon’t know non-determinism. A prototype interpreter of P-Prolog has been implemented in C-Prolog. We are now implementing a P-Prolog interpreter in the C language.

[1]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[2]  Kazunori Ueda,et al.  Guarded Horn Clauses , 1986, LP.

[3]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[4]  Ehud Shapiro,et al.  A subset of Concurrent Prolog and its interpreter , 1988 .

[5]  C. A. R. Hoare,et al.  Algorithm 65: find , 1961, Commun. ACM.

[6]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[7]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

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