New facilities of constraint logic programming

In this paper we focus on new facilities of a logic programming system ECLiPSe and propose a way of using these facilities for implementation of a constraint programming method called Subdefinite Computations. We briefly describe the Interval Domain library which employs the proposed implementaion technique for solving non-linear constraints. The capabilities of the Interval Domain library are illustrated by the Euclidean Steiner Tree Problem.