coop@panther.cerc.wvu.wvnet.edu (02/28/90)
I have noticed several mentions of Parlog on the net, and it looked like a parallel implementation of Prolog. Where can I get any documentation on it, or any other parallel-oriented logic-based languages ? Boris Pelakh "Software - a spell one casts on a pelakh@cerc.wvu.wvnet.edu computer to transform input into coop@cerc.wvu.wvnet.edu errors." -- Me Disclaimer : If my employer knew what I did with the time I get paid for, I would be out of a job. Let's keep this between us, OK ?
grd@portia.Stanford.EDU (Glendon Diener) (03/02/90)
In article <8189@hubcap.clemson.edu> coop@panther.cerc.wvu.wvnet.edu writes: >I have noticed several mentions of Parlog on the net, and it looked like >a parallel implementation of Prolog. Where can I get any documentation on it, >or any other parallel-oriented logic-based languages ? > >Boris Pelakh "Software - a spell one casts on a About two years ago, Keith Clark from Imperial College was visiting Stanford, and he taught a great course on PARLOG. We used the following text: Gregory, Steve. Parallel Logic Programming in PARLOG: The language and its Implementation. Addison-Wesley, 1987.
mmh@cs.qmw.ac.uk (Matthew Huntbach) (03/02/90)
In article <8189@hubcap.clemson.edu> coop@panther.cerc.wvu.wvnet.edu writes: >I have noticed several mentions of Parlog on the net, and it looked like >a parallel implementation of Prolog. Where can I get any documentation on it, >or any other parallel-oriented logic-based languages ? > No, it's not a parallel implementation of Prolog. Backtracking plays a fundamental part in Prolog, but Parlog and the other concurrent logic languages don't have it. On the other hand, their concurrency introduces a whole new dimension to logic programming. Better to think of it as another sort of logic programming language. The commercial version of Parlog is called "Strand". It is available from: Strand Software Technologies Artificial Intelligence Ltd Greycaine Road Watford Hertfordshire WD2 4JP England Tel. 0923 247707 They also have a USA distributor: Strand Software Technologies Inc 15220 N W Greenbrier Parkway, Suite 350 Beaverton OR 97006 USA Tel. (503) 690-9830 They will also provide you with a book on programming in the language by Steve Taylor and Ian Foster (I can't remember the details of this book). Another book is "Programming in Parlog" by Tom Conlon, published by Addison-Wesley. I don't really like this book, but since there's very little else in book form, it's worth getting. A recent edition of ACM Computing Surveys had a paper by Ehud Shapiro on the concurrent logic languages, with an extensive bibliography. If you're interested in the technical and theoretical details behind the languages, this would be a good starting place. Matthew Huntbach
ad@theocratus.doc.ic.ac.uk (Andrew Davison) (03/05/90)
A previous message asked about Parlog and other
languages of the same type. They're generally called
concurrent Logic Programming (LP) languages, and
a fairly comprehensive survey of them appeared
in the Sept. 1989 issue of Computing Surveys.
The paper is called something
like 'The family of Concurrent LP languages', and is by
E. Shapiro.
For more specific information on Parlog, you can try
mailing :
parlog@doc.ic.ac.uk
That's the general email address of the Parlog Group.
An excellent introductory text on Parlog has been
written by Tom Conlon, called 'Programming in Parlog'.
It was published by Addison Wesley in 1989.
Andrew Davison
The Parlog Group,
Dept. of Computing,
Londonken%aiai.edinburgh.ac.uk@NSFnet-Relay.AC.UK (Ken Johnson) (03/05/90)
In article <8205@hubcap.clemson.edu> mmh@cs.qmw.ac.uk (Matthew Huntbach) writes: >The commercial version of Parlog is called "Strand". >It is available from: .... E-mail strand-88@ail.co.uk (or maybe just strand@ail.co.uk) Strand is not a version of Parlog. It is a subset. There are also some syntactic differences. >They will also provide you with a book on programming in the >language .... Foster I and Taylor S: Strand, new concepts in parallel programming. Prentice Hall, 1990. ISBN 0-13-850587-x