Category: Constraint
Institution: Tokyo Daigaku Department of Information
        Science
Abstract: This paper presents a constraint logic programming
        language cu-Prolog and introduces a simple Japanese
        parser based on Japanese Phrase Structure Grammar
        (JPSG) as a suitable application of cu-Prolog.
        cu-Prolog adopts constraint unification instead of
        the normal Prolog unification.  In cu-Prolog,
        constraints in terms of user defined predicates can
        be directly added to the program clauses.  Such a
        clause is called Constraint Added Horn Clause (CAHC).
        Unlike conventional CLP systems, cu-Prolog deals with
        constraints about symbolic or combinatorial objects.
        For natural language processing, such constraints are
        more important than those on numerical or boolean
        objects.  In comparison with normal Prolog, cu-Prolog
        has more descriptive power, and is more declarative.
        It enables a natural implementation of JPSG and other
        unification based grammar formalisms.
Number: 89-008
Bibtype: TechReport
Author: Tuda Hirosi
        Hasida Koiti
        Sirai Hidetosi
Month: apr
Title: JPSG Parser on Constraint Logic Programming
Year: 1989