A WAM-based abstract machine for interval constraint logic programming

We propose an integration of constraint interval arithmetic into logic programming at the machine architectural level, of which WAM is the de facto standard. The language in consideration is ICL, a subset of ICHIP which shares the same semantic properties as CHIP. We use the work of D. Diaz and P. Codognet (1993) as a starting point, and exploit the simplicity of interval constraint solving over finite domain constraint solving. The resulting extension of WAM Is simple, efficient, robust, and portable. Our ICL prototype compares favourably against BNR Prolog, CLP(BNR), Echidna, and CLP(R) in various types of numerical examples