Ueda, K., Parallelism in Logic Programming. In Information Processing 89, Ritter, G. X. (ed.), NorthHolland, 1989, pp. 957-964. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Designing a Concurrent Programming Language - Ueda (1990) (5 citations) Self-citation (Ueda) (Correct)
No context found.
Ueda, K., Parallelism in Logic Programming. In Information Processing 89, Ritter, G. X. (ed.), NorthHolland, 1989, pp. 957-964.
Moded Flat GHC and Its Message-Oriented Implementation Technique - Ueda, Morita (1994) (20 citations) Self-citation (Ueda) (Correct)
....information, is expressed in terms of its logical reading and in which the dynamic property, namely the causality between input and output information, is specified using the guard construct. Readers who are unfamiliar with (Flat) GHC and concurrent logic programming are referred to [14] 15] [18] and [19] A prominent feature of Flat GHC and other concurrent logic languages viewed as process description languages is that they use unification (or its restricted forms such as matching) for interprocess communication. Externally, a process is viewed as an abstract entity that observes and ....
Ueda, K., Parallelism in Logic Programming. In Information Processing 89, Ritter, G. X. (ed.), North-Holland, Amsterdam, 1989, pp. 957--964.
Potentiality of Parallelism in Logic - Kurfeß (1991) (Correct)
No context found.
Ueda, K. (1989). Parallelism in logic programming. Technical Report TR-495, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.
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