(18) Parallel Constraint Logic Programming System: GDCC

	Machine:     Multi-PSI
	Environment: PIMOS
	Language:    KL1
	Source Code: 1.2 MB
	Documents:   Manual (English)

Overview

GDCC is a parallel constraint logic programming language,which is highly declarative,flexible and efficient,and can deal with various constraints including non-linear polynomial equations.

Characteristics

Constraint logic programming(CLP) is a powerful programming methodology that allows you to specify what(declarative knowledge) without how(procedural knowledge). To provide a more flexible and efficient language,GDCC parallelizes both logic language and constraint solvers.

Functions

"How to solve" to "What to solve":
When you use a conventional language,you have to describe a method to solve the problem. Therefore,you have to find or select a solution method. On the other hand,when you use GDCC,you can make the program only describe relations which hold in the problem. The mechanisms to solve the relations,called constraint solvers,are built into the GDCC system.

Two level parallelism:
GDCC provides a more flexible and efficient CLP language by parallelizing both the logic language and constraint solvers.

Various constraint solvers:
The GDCC system has three parallel constraint solvers:
  1. an algebraic constraint solver,
  2. a boolean constraint solver,
  3. a linear constraint solver.

Block:
The block is the meta control mechanism that provides the following facilities:
  1. to handle multiple environments,
  2. to localize failure,
  3. to specify a certain constraint set on evaluating a goal.

Finding real roots:
GDCC provides a facility that computes the real roots of the univariate equations and returns all root combinations. Each solution can be handled individually by using the block mechanism.

FTP

www-admin@icot.or.jp