%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

     ICOT FREE SOFTWARE No.92 Constraint MGTP

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


1. The outline of this software

Constraint MGTP (CMGTP) is the model generation theorem 
prover (MGTP) system extended 
for solving finite domain constraint satisfaction problems.
In CMGTP, negative atoms are permitted as the representation of 
input clauses. CMGTP has the pruning abilities by using negative atoms.

One major application domain of CMGTP is quasigroup problems 
in finite algebra. We, ICOT has been trying to solve these 
problems by CMGTP, resulting high performance.

CMGTP can run on the parallel machines such as 
SparcCenter and PIM/m as well as Sparc WSs.
We achieved almost linear speedups on PIM/m.

CMGTP can be applied to other constraint satisfaction problems.
You can make experiments 
for constraint propagation mechanism on CMGTP.

2. The structure of this software

This software includes : 

   README.j          README (In Japanese)
   README.e          this file
   mgtp-manual-J.ps  manuals in Japanese (PS file)
   mgtp-manual-E.ps  manuals in English (PS file)
   KL1/              source files of KL1(PIM) version 
   KLIC/             source files of KLIC version
   Prolog/           source files of Prolog version

We have 3 types of CMGTP systems : 
Prolog version which can be run on SICStus Prolog,
KLIC version and KL1 version which can be run on PIM/m.

3. Manual

As for CMGTP system, see section 5 of the MGTP manual.

4. If you have any trouble with this software, please let me
   know. Comments, suggestions, and bug fixes are welcome.

ifs@icot.or.jp