Category: Constraint
Organization: ACM SIGACT-SIGPLAN
Comment: 制約論理プログラミングは論理プログラミングに算術的制
        約を付加したものである。ただの制約プログラミングは全
        てのオブジェクトをHerbrand空間に写像しなければならな
        かったが、算術的制約を直接書くことができると直感的に
        わかりやすくなる。算術的制約解決には従来の制約解決手
        法を適用することができる。
        プログラムはホーン節の述語の替わりに制約記述も許す格
        好をしており、ゴールリダクション手法を適用した後制約
        だけが残るように動く。
Abstract: We address the problem of designing programming
        systems to reason with and about constraints Taking a
        logic programming approach, we define a class of
        programming languages, the CLP languages, all of
        which share the same essential semantic properties.
        From a conceptual point of view, CLP programs are
        highly declarative and are soundly baed within a
        unified framework of formal semantics. This framework
        not only subsumes that of logic programming, but
        satisfies the core properties of logic programs more
        naturally. From a user's point of view, CLP programs
        have great expressive power due to the constraints
        which they naturally manipulate. Intuition in the
        reasoning about programs is enhanced as a result of
        working directly in the intended domain of discourse.
        This constrasts with working in the Herbrand Universe
        wherein every semantic object has to be explicitly
        coded into a Herbrand term; this enforces reasoning
        at a primitive level. Finally, from an implementor's
        point of view, CLP systems can be efficient because
        of the exploration of constraint solving techniques
        over specific domains.
Bibtype: InProceedings
Booktitle: Proceedings of the SIGACT-SIGPLAN Symposium on
        Principles of Programming Language
Author: Joxan Jaffer and Jean-Louis Lassez
Pages: 111-119
Month: jan
Title: Constraint Logic Programming
Year: 1987
Keyword: constraint logic programming, CLP, constraint
        programming, logic programming