Abstract This paper describes three significant extensions for the Finite Domain solver of
GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and
prevents integer overflows from occurring. Third, the internal representation of sparse
domains has been redesigned to overcome its current limitations. The preliminary
performance evaluation shows a limited slowdown factor with respect to the initial solver.
This factor is widely counterbalanced by the new possibilities and the robustness of the ...
