K. Ueda. Concurrent Prolog: collected papers, volume 1, chapter Guarded Horn Clauses. M.I.T. Press, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Programming Languages - Pingali (1998) (Correct)
....This requires the first sub goal to produce Z and the second sub goal to read it. Similarly, PARLOG [10] has mode declarations on variables in the left hand side of clauses. A limited form of or parallelism called committed choice or parallelism that uses Dijkstra s guards has been proposed in GHC [42] and PARLOG. Logic programming ideas continue to be used in areas like artificial intelligence, but there is little mainstream interest at this point. The early enthusiasm for separating the logic of algorithms from their control did not last very long, and logic programming found themselves ....
K. Ueda. Concurrent Prolog: collected papers, volume 1, chapter Guarded Horn Clauses. M.I.T. Press, 1987.
Data-parallel Implementation of Prolog - Bevemyr (1996) (Correct)
....5. Instead of output unification, variables were allowed only one producer and, in some languages, only one consumer. 1.3. Reform Prolog 5 Examples of languages which exhibit one or more of these simplifications are: Concurrent Prolog [173, 174] FCP [175, 226] Parlog [53, 54] F)GHC [203, 204], Strand [77] and Janus [168] These simplifications made it harder to write programs in these languages, the introduction of explicit concurrency being one of the main reasons. The following quote is from Tick s book on parallel logic programming [193, p. 410] The book contains many programs ....
K. Ueda, Guarded Horn clauses, Concurrent Prolog: Collected Papers, vol. 1, MIT Press, 1987. --5
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC