Category: Constraint
Journal: IEEE Software
Institution: Xerox PARC
Comment: 論理言語は制約パラダイムのサブセットである。論理プロ
        グラミングは純粋に論理だけでできているわけではなく、
        算術計算や入出力のような論理的でない部分を含んでいる
        ので汎用の制約記述言語の方がよい。制約言語はインプ
        リシットな並列動作記述に向いている。局所的な制約伝播
        により制約を解決する。(制約を満たす値の集合を各制約間
        でやりとりする。) (並行オブジェクト指向のメッセージ通
        信みたいなものか)
        並列性はAND,ORなどの演算子と∀のような記号により導か
        れる。
Abstract: The author describes a constraint-based language,
        Consul, that can exploit implicit parallelism. The
        results are reported of the first stage of the Consul
        project, which was designed to	produce empirical
        evidence for or against Consul as a parallel
        language. To produce the evidence, a
        parallel-execution model is developed that is based
        on local propagation and uses some important
        generalizations of earlier work on local propagation.
        A set of tools was developed to measure the execution
        of several Consul programs. The results suggest that
        considerable parallelism is available in Consul
        programs and that local propagation is a viable
        mechanism for solving most real-world constraints.
        The Consul programs demonstrate that programmers can
        control performance through the proper choice of
        algorithms, despite Consul's declarative nature.
Number: 4
Bibtype: Article
Author: D. Baldwin
Pages: 62-69
Month: jul
Title: Consul: a parallel constraint language
Year: 1989
Volume: 6
Keyword: consul, constraint
Address: Palo Alto, Calif.