Finite domain constraint solvers are typically applied to problems with only quite small values. This is the case in many tasks for which constraint-based approaches are well suited. A well-known benchmark library for constraints, CSPLib ([1]), consists almost exclusively of such examples.rnOn the other hand, the need for arbitrary precision integer arithmetic is widely recognised, and many common Prolog systems provide transparent built-in support for arbitrarily large integers.rnIt thus seems natural to enhance a constraint solver over finite domains with the ability to reason over arbitrarily large integers. SICStus Prolog ([2]) already goes in that direction, using the symbolic constants inf and sup to denote default domain limits, but internally, they still correspond to quite small integers: The system yields a representation errors when these limits are exceeded.
展开▼
