cu-Prolog(ID:5044/cup005)

contraint extensions to Prolog
Related languages
Prolog => cu-Prolog   Extension of
References:
  • Tuda Hirosi,Hasida Koiti,Sirai Hidetosi "JPSG Parser on Constraint Logic Programming" Technical Report #89-008, Tokyo Daigaku Department of Information Science BH/9TG/7 April 1989 view details 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