
Set Constraint Solver - KLIC Version 2.0 -

Copyright (C) 1999 Yosuke Sato

Machine:	Unix machine
Environment:    Unix
language:	KLIC
Source Code:    170 KB(about 2000 lines in KLIC)
Document:	Manual (English/Japanese)

Overview

"Set Constraint Solver" is a small system that is based on computer algebla.
It offers an experimental environmet of our original (Boolean) Groebner bases 
that is not available in any other existing computer algebla systems.
It also offers a set constraint solver bases on our Grobner bases.
In this release, the algorithm of the computation of Gr\"{o}bner bases is updated according to
our new theory. 
This algorithm is essentialy a parallel algorith, although even a sequential implementation is
much faster than the previous one.
We include two source programs, one for sequential computation and another for parallel computation.

Features

"Set Constraint Solver"  offers two kinds of programs.
One is for calculating Groebner bases in polynomial rings
over Boolean rings. You can experiment on various calculations  
of our a little bit queer Groebner bases.
The another one is for solving constraints of sets. You can handle
various types of set constraints using our Groebner bases.
The whole program is written in KLIC. 
In any OS where KLIC compiler works, our program is available.

Function

Set Constraint Solver:	Various types of set constraints can be handled by 
                	starting a set constraint solving session.

Term Order:		Any type of block order is available in calculation of Groebner bases

Grobner bases:		Groebner bases and Comprehensive Groebner bases of Boolean polynomial
			rings can be computed.

Parallel computation	Parallel computation is available by using the distributed KLIC








