(14) Constraint Logic Programming Language: CAL in CESP

	Machine:     UNIX machine
	Environment: UNIX, CESP, GMP
	Language:    CESP
	Source Code: 1 MB
	Documents:   Manual (English)

Overview

CAL is a sequential constraint logic programming language which can deal with various constraints including non-linear polynomial equations.

Functions

Constraint Logic Programming(CLP) Language CAL is a programming language based on a new programming pradigm, constraint programming. This paradigm allows us the high-level description of the problem. By using CAL, the user enable to solve problems without stating the methods to solve them.

Run in CESP

The language processor is run on Common ESP, which is the ESP language processor available on UNIX machine.

From "How to solve" to "What to solve"

By conventional programming lan-guage, the user have to select or invent the method to solve problems todescribe the method to solve them in terms of programs. On, by using CAL, all the user have to do to solve them is to describe relations defining the problems in terms of constraints.

Supports various problem domains

CAL handles the following constraints:

non-linear algebraic equations,
equations on the truth values, and
linear equations and linear inequalities.

Provides Multiple Environment Handler

To support context dependent functions, the system provides the multiple environment handler.

Provides the function to approximate real roots

For non-linear algebraic constraints, the system provides the function to approximate real toots of univariate constraints. All real roots can be obtained via backtracking, and can be handled through contexts.

Remark

Numerical calculation in the system uses GNU Multiple Precision Package(GMP).

FTP

Constraint Logic Programming Language: CAL in CESP [315K]

www-admin@icot.or.jp