(10) Set Constraint Solvers

"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 was written in prolog last year. It is written in klic this year. The klic version is about 30 times faster than the prolog version for solving a big problem. Now it can calculate a groebner basis of polynomials with 50 variables less than 1 minutes in a standard personal computer.