| @@ -1,11 +1,10 @@ | | | @@ -1,11 +1,10 @@ |
1 | cu-Prolog is an experimental constraint logic programming language. | | 1 | cu-Prolog is an experimental constraint logic programming language. |
2 | Unlike most conventional CLP systems, cu-Prolog allows user-defined | | 2 | Unlike most conventional CLP systems, cu-Prolog allows user-defined |
3 | predicates as constraints and is suitable for implementing a natural | | 3 | predicates as constraints and is suitable for implementing a natural |
4 | language processing system based on the unification-based | | 4 | language processing system based on the unification-based grammar. |
5 | grammar. As an application of cu-Prolog, we developed | | 5 | As an application of cu-Prolog, we developed a JPSG (Japanese Phrase |
6 | a JPSG (Japanese Phrase Structure Grammar) parser | | 6 | Structure Grammar) parser with the JPSG Working Group (the chairman is |
7 | with the JPSG Working Group (the chairman is Prof. GUNJI, Takao of | | 7 | Prof. GUNJI, Takao of Osaka University) at ICOT. |
8 | Osaka University) at ICOT. | | | |
9 | | | 8 | |
10 | cu-Prolog is also the complete implementation of the constraint | | 9 | cu-Prolog is also the complete implementation of the constraint |
11 | unification and its name (cu) comes from the technique. | | 10 | unification and its name (cu) comes from the technique. |