(9) CLP Language: cu-Prolog

	Machine:     UNIX machine
	Environment: UNIX
	Source Code: 0.4 MB
	Language:    C
	Documents:   User's Manual (English/Japanese)

Overview

cu-Prolog is a symbolic and combinatorial constraint logic programming language.

Features

cu-Prolog interpreter is written only in the C language.
cu-Prolog support Partially Specified Term(PST) for feature structures of constraint-based grammar formalisms.
For example,
```
{f/a,g/b,h/X}.
```
Its symbolic and combinatorial constraint solver is based on the unfold/fold transformation.

Function

Most CLP languages treat numerical constraints in terms of algebraic equations or inquations. However, for natural language processing or AI applications in general, symbolic and combinatorial constraints are far more important. cu-Prolog was designed to process the latter kinds of constraint.

cu-Prolog programs consist of the following Constrained Horn Clauses(CHC).

The Constraint part contains user-defined Prolog predicates such as

      member(X,[ga,wo,ni]) or head_feature_principle(H,M,D).

The constraint solver uses unfold/fold transformation, which is well-known as a program transformation technique, with some heuristics.

A simple Japanese parser based on JPSG (Japanese Phrase Structure Grammar) is one of the most successful application of cu-Prolog. Various constraints of the constraint-based grammar formalism are naturally and elegantly described with PSTs and combinatorial constraints of cu-Prolog.

FTP

README,
HISTORY,
INSTALL,
DOCUMENT.
CLP Language: cu-Prolog [108K]

www-admin@icot.or.jp