B-Prolog 2.1

Appeared in Volume 10/2, May 1997

Version 2.1 differs from the previous version in that it supports delaying and is able to compile constraints over finite and binary domains. As a finite-domain constraint solver, B-Prolog is as fast as clp(FD) developed by Codognet and Diaz, but the compilation is an order of magnitude faster.

Free copies are available for research and education purposes only. Please contact the author via email and be sure to include a brief description about where you plan to use the system.

Neng-Fa Zhou
Email: zhou@mse.kyutech.ac.jp