[ Bristol CS | Index ] The paper presents CHUKL, a parallel finite-domain constraint solving system. The implementation is written in the concurrent logic programming language KL1, instead of C. The work challenges the assumption that committed choice concurrent logic programming languages cannot deal with don't know non-determinism. A dynamic forking scheme is designed and implemented to handle choicepoint making. The work also demonstrates that KLIC, an efficient implementation of KL1, is a powerful parallel programming tool which allows us rapid prototyping. The development on CHUKL has gone through several stages: three different versions of the runtime system were implemented. The performance of the latest version is reasonably close to CHIP which is a refined low-level implementation in C.
The full paper is available in gzipped PostScript format.