Guarded Horn Clauses

Guarded Horn Clauses

(language)
(GHC) A parallel dialect of Prolog by K. Ueda in which each clause has a guard. GHC is similar to Parlog. When several clauses match a goal, their guards are evaluated in parallel and the first clause whose guard is found to be true is used and others are rejected. It uses committed-choice nondeterminism.

See also FGHC, KL1.
Mentioned in ?
References in periodicals archive ?
Finally, he proposed Guarded Horn Clauses (GHC) [22, 24].
During the project, we succeeded in developing a concurrent logic programming language called Guarded Horn Clauses (GHC), and have been developing our final target parallel computer, the Parallel Inference Machine (PIM).
Japan's Institute for New Generation Computer Technology (ICOT) initial flirtation with Concurrent Prolog found it wanting [31, 33], and subsequent analysis led to the development of Guarded Horn Clauses (GHC) [32, 33].