抄録
This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.
| 元の言語 | English |
|---|---|
| ページ（範囲） | 6-13 |
| ページ数 | 8 |
| ジャーナル | NEC Research and Development |
| 発行部数 | 84 |
| 出版物ステータス | Published - 1987 1 |
| 外部発表 | Yes |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
これを引用
INTRODUCTION TO GUARDED HORN CLAUSES. / Ueda, Kazunori.
：: NEC Research and Development, 番号 84, 01.1987, p. 6-13.研究成果: Article
}
TY - JOUR
T1 - INTRODUCTION TO GUARDED HORN CLAUSES.
AU - Ueda, Kazunori
PY - 1987/1
Y1 - 1987/1
N2 - This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.
AB - This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.
UR - http://www.scopus.com/inward/record.url?scp=0023168750&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023168750&partnerID=8YFLogxK
M3 - Article
SP - 6
EP - 13
JO - NEC Research and Development
JF - NEC Research and Development
SN - 0048-0436
IS - 84
ER -