Ueda, K. (1988) Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. Programming of Future Generation Computers, Nivat, M. and Fuchi, K. (eds.), North-Holland, Amsterdam, pp.441--456.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....models for both sequential Prolog and parallel logic languages. One of the rst models of parallel logic programming was implemented in the family of committed choice languages [26] well known representatives of which are Concurrent PROLOG [25] PARLOG [13] and Guarded Horn Clauses (GHC) [32]. Committed choice languages support don t care nondeterminism and the parallel composition of goals. Further descendants of these languages, such as Flat Concurrent Prolog [19] and Flat GHC [23] are based on at guards. In an attempt to combine the sequential logic programming model of Prolog, ....

K. Ueda. Guarded Horn clauses: a parallel logic programming language with the concept of a guard. In M. Nivat and K. Fuchi, editors, Proceedings of Programming of Future Generation Computers, pages 441-456. North Holland, 1988.

....is being built incrementally. Therefore, GENET satisfies incrementality. 3 The PROCLANN Language In this section, we describe the PROCLANN (PROgramming in Constraint Logic with Artificial Neural Network) language. PROCLANN is a committedchoice language with a syntax similar to that of Flat GHC [29, 30]. This design decision is justifiable by the fact that goal reduction is used only to inject constraints into a neural network but not to perform searching. The operational semantics of PROCLANN is similar to that of the CLP scheme [16, 17] but the use of an ANN based constraint solver is made ....

K. Ueda. Guarded horn clause: A parallel logic programming language with the concept of a guard. Technical Report TR-208, Institute of New Generation Computer Technology, Tokyo, Japan, February 1987.

....at least as efficient, if not slightly better, than the improved GENET. 3 The PROCLANN Language In this section, we describe the PROCLANN (PROgramming in Constraint Logic with Artificial Neural Network) language. PROCLANN is a committed8 choice language with a syntax similar to that of Flat GHC [23, 24]. This design decision is justifiable by the fact that goal reduction is used only to inject constraints into a neural network but not to perform searching. The operational semantics of PROCLANN is similar to that of the CLP scheme [13, 14] but the use of an ANN based constraint solver is made ....

K. Ueda. Guarded horn clause: A parallel logic programming language with the concept of a guard. Technical Report TR-208, Institute of New Generation Computer Technology, Tokyo, Japan, February 1987.

....The microprocessor, called PU (Processing Unit) is also used as a key component of AI workstations. Thus, PU has capability to execute two different type logic programming languages, KL1[2] for PIM m and ESP[3] for the AI workstation. KL1 is a parallel logic programming language based on flat GHC[4], and is very powerful to represent parallel processes communicating each other. ESP is the language in which Prolog and object oriented language features are combined, in order to make it easy to construct large and practical AI programs. Since the execution mechanisms of both languages stand on ....

K. Ueda, Guarded Horn Clauses : A Parallel Logic Programming Languages with the Concept of a Guard. TR 208, ICOT, 1986.

....This made Relational Language capable of describing don t care nondeterministic processes. The subsequent concurrent 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 ....

Ueda, K. Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. In Programming of Future Generation Computers, Nivat, M. and Fuchi, K. (eds.), North-Holland, 1988, pp. 441-- 456.

....Many concurrent languages designed so far were built by adding a number of special constructs to existing sequential languages, adding certain complexity as well. So it is worth trying to build a concurrent language in a totally di erent way. Guarded Horn Clauses (abbreviated to GHC) 21] [22] was designed to be a simple concurrent programming language with a very small number of primitive constructs. As its name suggests, GHC borrowed a lot of concepts from (ordinary) logic programming, which, together with the concept of a guard, were tailored into a concurrent language. Hence it is ....

Ueda, K., Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. ICOT Tech. Report TR-208, ICOT, Tokyo,

.... 1 proposed technique will expand the application areas of concurrent logic languages. Keywords: Concurrent logic programming, Moded Flat GHC, Static mode system, Constraint based program analysis, Message oriented implementation. 1. Introduction Guarded Horn Clauses (GHC) 16][17][19] is a simple concurrent logic language born from the research on parallelism in logic programming. Its subset, Flat GHC [19] 21] can be viewed naturally as a process description language in which the static property of a process (implemented by a multiset of body goals) namely the ....

Ueda, K., Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. ICOT Tech. Report TR-208,

....a method of compiling a naive logic program into (very) low level languages. 1. INTRODUCTION This paper complements the previous paper [14] by the author and extends the method described in it. The previous paper showed a systematic method for compiling a Horn clause program into a GHC [13][15][16] program or a deterministic Prolog program that returns a list of all the solutions of the original program. The method compiled away the primitives for collecting solutions such as bagof, which had usually been considered as important extension to Prolog. The compilation generally retained ....

Ueda, K., Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. ICOT Tech. Report TR208, ICOT, Tokyo, 1986.

No context found.

Ueda, K. (1988) Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. Programming of Future Generation Computers, Nivat, M. and Fuchi, K. (eds.), North-Holland, Amsterdam, pp.441--456.

No context found.

Ueda, K. (1986). Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. Technical Report TR-208, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.

No context found.

Ueda, K., 1986, Guarded Horn Clauses: a Parallel Logic Programming Language with the Con8 cept of a Guard. Technical Report TR-208.

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