Abstract
This 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 [Shapiro 83], mode declaration [Clark and Gregory 84] and communication constraints [Ueda 85] 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 either don't care non-determinism or don'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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chang C. and Lee R. C., "Symbolic Logic and Mechanical Theorom Proving", Academic Press, New York San Francisco London, 1973.
Clark K. and Gregory S., "PARLOG: Parallel Programming in Logic", Research Report DOC, April,1984.
Clocksin W.F. and Mellish C.S., "Programming in Prolog", Springer-Verlag Berlin Heidelberg New York, 1981.
Hoare C.A.R., "Algorithm 64", CACM, Vol. 4, pp 321, 1961.
Kowalski R., "Logic for promlem solving", NORTH-HOLLAND, 1979.
Shapiro E.Y., "A Subset of Concurrent Prolog and Its Interpreter", Technical Report TR-003 ICOT, Tokyo, Feb.,1983.
Ueda K., "Guarded Horn Clauses", Technical Report TR-103 ICOT, Tokyo, June, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, R., Aiso, H. (1986). P-Prolog: A parallel logic language based on exclusive relation. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_80
Download citation
DOI: https://doi.org/10.1007/3-540-16492-8_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16492-0
Online ISBN: 978-3-540-39831-8
eBook Packages: Springer Book Archive