Ringwood, G. A. Parlog86 and the Dining Logicians. Comm. ACM, Vol. 31, No. 1 (1988), pp. 10--25.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....logic languages attempted to refine existing ones or to enhance their expressive power. These languages include Concurrent Prolog [34] PARLOG [5] Guarded Horn Clauses (GHC) 37] 38] Flat Concurrent Prolog [35] and Oc [18] A survey and a genealogy of these languages can be found in [36] and [31], respectively. Here, we introduce GHC without guard goals as a process description language. This subset of GHC is essentially equivalent to Oc, which is the simplest of the concurrent logic languages. A program is a set of guarded clauses of the following form: h : B where h is an atom(ic ....

Ringwood, G. A. Parlog86 and the Dining Logicians. Comm. ACM, Vol. 31, No. 1 (1988), pp. 10--25.

....the agent has two unique communication channels, to its super agent and sub agents. This property allows to a simple design of MRL. 3 Controlling Multiagent Robots 3. 1 Multiagent robot language MRL originated from a class of committed choice concurrent logic programming languages (CCL) 12] 17][11] and has an extended CCL syntax for multiagent programming. An MRL program consists of the following guarded Horn clause: H : 0 G j B: where H , G and B are head, guard, and body. The guard and body consist of atomic formulas. The above clause means H is implied by G and B . In operation, the ....

....implemented within the underlying parallel logic language. One of the directions of MRL is to consider a collision avoidance method based on MRL. Another direction of MRL is to avoid the deadlock problem in multiagent robots. Using parallel logic languages is an elegant approach to this problem [11], but our approach is to provide an inductive learning facility where deadlock situations are analyzed and some general rules are generated to extract deadlock patterns. We developed an inductive learning system which produces f irst order clauses from facts and domain knowledge [10] A ....

Ringwood GA, Parlog86 and the Dining Logicians, Communication of ACM 31, pp. 10-25, 1988.

....For some programs, object mutations are mainly instantiations, i.e. an object may be created in some partially constructed form, and parallel threads fill in the missing pieces. This form of mutation can be handled by futures [Hal85] I structures [ANP87] and logical variables in logic programs [Rin89] Since objects cannot be mutated after instantiation, the only kind of race condition arises from whether or not an object has been computed. Special hardware or software checks can prevent threads from observing uninstantiated objects. In any of these restricted paradigms, the possibility for ....

G. A. Ringwood. Parlog85 and the dining logicians. Communications of the ACM, 31(1):10--25, January 1989.

....in 1988 by the author and Steve Taylor, and the first compiler was released by Strand Software Technologies in 1989. In 1990, Strand was awarded the British Computer Society s Award for Technical Innovation. The Strand design builds on work in concurrent logic programming at Imperial College [8, 11, 17, 28], the Weizmann Institute [26, 29, 32] and elsewhere. Concurrent logic programming itself has intellectual roots in logic programming [9, 22] functional programming [20, 25] guarded commands [10] and CSP [19] However, Strand omits many characteristic features of logic programming languages, ....

Ringwood, G., PARLOG86 and the dining logicians, CACM, 31(1), 10--25, 1988.

....by David Gelernter has recently attracted much interest as a method of enabling communication between, and synchronization of, parallel processes. A recent paper#[2] compared this paradigm with other approaches to parallelism, specifically with the concurrent logic programming language Parlog86#[3]. Subsequent discussion#[4] compared Linda with the FCP family of languages#[5] In Gelernter s reply to this discussion, he noted that a Linda based parallel Prolog is a potentially more elegant, expressive and efficient alternative to the concurrent logic programming languages. This paper ....

G.A. Ringwood, Parlog86 and the Dining Logicians, C. ACM, 31(1) (1988), pp 10-25.

....and as efficient in concurrent logic languages as in Prolog and OR parallel languages, then one of the main barriers against their wider adoption is removed. We use a language which is weak in logic programming terms, being drastically cut down for the sake of efficiency, a version of Parlog86 [Ringwood 88] which is flat and uses simple assignment (with the logic variable restriction that a variable may only be assigned once) in the place of unification. This language is now being developed at Queen Mary and Westfield College in London under the name Reactive Guarded Definite Clauses or RGDC ....

. G.A.Ringwood. Parlog-86 and the dining logicians. Comm. ACM 31, 1 pp.10-25.

....as used by Josephs in [66] Logical variables are a non functional extension to functional languages, which enable a greater control of synchronisation than is possible with just a pure functional language. A great deal of use has been made of logical variables in parallel logic programming, see [96]. The buffer function may be defined thus: buf k f l = par (seq (seqlist init) ff ctrl rest) f l ) where l = zipwith gg ctrl l init = take k l rest = drop k l ctrl = inflstlogvars ff c [ CHAPTER 9. FURTHER WORK 247 ff (GO:c) x:xs) seq x (ff c xs) gg c x = seq ....

G A Ringwood. Parlog86 and the dining logicians. CACM, 31(1):10--25, January 1988.

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