Abstract
Parlog is a logic programming language in the sense that nearly every procedure can be read as a definition of a relation in first-order predicate logic. Parlog differs from Prolog in incorporating parallel evaluation. It incorporates both AND-parallelism and OR-parallelism. This chapter is an updated and shortened version of [4]. A more-detailed account of the language can be found in [16].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Broda and S. Gregory, “PARLOG for Discrete Event Simulation,” Proc. 2nd Int’l Logic Programming Conference, Uppsala, Sweden, July 1984, pp. 301–312.
K. L. Clark, “Negation as Failure.” In H. Gallaire and J. Minker (eds.), Logic and Databases. New York: Plenum Press, 1978.
K. L. Clark and S. Gregory, “A Relational Language for Parallel Programming.” Proc. 1981 ACM Conf. on Functional Programming Languages and Computer Architecture, Portsmouth, NH, Oct. 1981, pp. 171–178.
K. L., Clark and S. Gregory, “PARLOG: Parallel Programming in Logic,” ACM Trans, on Programming Languages and Systems, 8(1): 1–49, 1986.
K. L., Clark and S. Gregory, “Notes on Systems Programming in PARLOG,” Proc. Int’l Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Nov. 1984, pp. 299–306.
K. L., Clark and S. Gregory, “Notes on the Implementation of PARLOG,” J. of Logic Programming 2 (l):17–42, 1985.
K. L. Clark and F. G. McCabe, “Micro-PROLOG: Programming in Logic,” Englewood Cliffs, Prentice-Hall, NJ: 1984.
K. L., Clark, F. G., McCabe, and S. Gregory, “IC-PROLOG Language features,” in K. Clark and S-A. Tarnlund (eds.), Logic Programming. London: Academic Press, 1982, pp. 253–266.
W. F. Clocksin and C. Mellish, Programming in Prolag. New York: Springer-Verlag, 1981.
J. Darlington and M. J. Reeve, “ALICE: A Multi-Processor Reduction Machine.” Proc. 1981 ACM Conf on Functional Programming Languages and Computer Architecture, Portsmouth, NH, Oct. 1981, pp. 65–75.
E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
I. T., Foster, “Logic Operating Systems: Design Issues.” Proc. 4th International Logic Programming Conf., Melbourne, Australia, May 1987.
D. P. Friedman and D. S. Wise, “CONS Should Not Evaluate Its Arguments,” In Proc. 3rd Int’l Colloquium on Automata, Languages and Programming. Edinburgh: Edinburgh University Press, 1976.
S. Gregory: “How to Use PARLOG.” Unpublished report, Department of Computing, Imperial College, London, England, Aug. 1984.
S. Gregory, Implementing PARLOG on the Abstract PROLOG Machine. Research Rep. DOC 84/23, Department of Computing, Imperial College, London, England, Aug. 1984.
S. Gregory, Parallel Logic Programming in PARLOG. Reading, MA: Addison-Wesley, 1987.
S. Gregory, I. T. Foster, A. D. Burt, and G. A. Ringwood, An Abstract Machine for the Implementation of PARLOG on Uniprocessors. Research rep., Department of Computing, Imperial College, London, England, Jan. 1987.
S. Gregory, R. Neely, and G. A. Ringwood, “PARLOG for Specification, Verification and Simulation.” Proc. 7th Int’l Symp. on Computer Hardware Description Languages and Their Applications, Tokyo, Japan, Aug. 1985, pp. 139–148.
A. Hansson, S. Haridi, and S-A. Tarnlund, “Properties of a Logic Programming Language.” In K. L. Clark and S-A. Tarnlund (eds.): Logic Programming, London: Academic Press, 1982, pp. 267–280.
P. Henderson and J. H. Morris, “A Lazy Evaluator,” Proc. 3rd ACM Symp. on Principles of Programming Languages, Jan. 1976, pp. 95–103.
C. A. R. Hoare, “Communicating Sequential Processes.” Comm. of the ACM, 21(8): 666–677,1978.
C. J. Hogger, Introduction to Logic Programming. London: Academic Press, 1984.
G. Kahn and D. B. MacQueen, “Coroutines and Networks of Parallel Processes,” Proc. of the IFIP Congress, 77:993–998, 1977.
R. A. Kowalski, “Predicate Logic as Programming Language.” Proc. of the IFIP Congress, 74: 569–574, 1974.
R. A. Kowalski, Logic for Problem Solving. New York: North Holland, 1979.
R. A. Kowalski, “Logic Programming,” Proc. IFIP Congress, 83:133–145, 1983.
A. Lam, M. Y. C. and S. Gregory, “PARLOG and ALICE: A Marriage of Convenience,” Proc. of the 4th Int’l Logic Programming Con., Melbourne, Australia, May 1987.
J. Levy, “A Unification Algorithm for Concurrent Prolog,” Proc. 2nd Int’l Logic Programming Conference, Uppsala, Sweden, July 1984, pp. 333–341.
Y. Matsumoto, “A Parallel Parsing System for Natural Language Analysis,” Proc. 3rd Int’l Logic Programming Conference, London, England, July 1986.
F. G. McCabe, Abstract PROLOG Machine—A Specification. Research Report DOC 83/12, Department of Computing, Imperial College, London, England, June 1984.
C. Mierowsky, Design and Implementation of Flat Concurrent Prolog. M.Sc. thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, Nov. 1984.
T. Miyazaki, A. Takeuchi, and T. Chikayama, “A Sequential Implementation of Concurrent Prolog Based on the Shallow Binding Scheme,” Proc. IEEE Symposium on Logic Programming, Boston, MA, July 1985, pp. 110–118.
E. Moens and B. Yu, Implementation of PARLOG on the Warren Machine, Tech. Rep., Department of Computer Science, University of British Columbia, Vancouver, Canada 1985.
M. J. Reeve, “A BNF Description of the ALICE Compiler Target Language.” Unpublished report, Department of Computing, Imperial College, London, England, March 1985.
J. Schwarz, Using Annotations To Make Recursion Equations Behave. Research rep. 43, Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland, 1977.
E. Y. Shapiro, A Subset of Concurrent Prolog and Its Interpreter. Tech. Rep. TR-003, ICOT, Tokyo, Japan, Feb. 1983.
E. Y. Shapiro, “Systems Programming in Concurrent Prolog,” Proc. 11th ACM Symp. on Principles of Programming Languages, Salt Lake City, UT, Jan. 1984.
K. Ueda, Guarded Horn Clauses. Tech. Rep. TR-103, ICOT, Tokyo, Japan, June 1985.
D. H. D. Warren, “Logic Programming and Compiler Writing,” Software—Practice and Experience, 10:97–125, 1980.
D. H. D. Warren, “An Abstract Prolog Instruction Set.” Technical Note 309, SRI International, Menlo Park, CA, Oct. 1983.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers
About this chapter
Cite this chapter
Clark, K., Gregory, S. (1988). Parlog: Parallel Programming in Logic. In: Kowalik, J.S. (eds) Parallel Computation and Computers for Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1989-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1989-4_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9188-6
Online ISBN: 978-1-4613-1989-4
eBook Packages: Springer Book Archive